Skip to search formSkip to main contentSkip to account menu

Complete coloring

Known as: Achromatic number 
In graph theory, complete coloring is the opposite of harmonious coloring in the sense that it is a vertex coloring in which every pair of colors… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Program Number: 4920 Poster Board Number: B0048 Presentation Time: 3:45 PM–5:30 PM The relationship between visual acuity… 
2014
2014
Design of interconnection networks is an important integral part of the parallel processing or distributed systems. There are a… 
2013
2013
Let G and H be two cographs. We show that the problem to determine whether H is a retract of G is NP-complete. We show that this… 
2013
2013
The silicates are the largest, the most interesting and the most complicated class of minerals by far. The basic chemical unit of… 
2009
2009
This project involved pulling together past work on the achromatic and first-fit chromatic numbers, as well as a description of a… 
2009
2009
In this paper, we find the achromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M… 
2001
2001
Achromatic number of a graph G is a maximum number of colours in a proper vertex colouring of G such that vertices of any two… 
1999
1999
. The achromatic number of a graph $G$ is the maximum number $k$ such that $G$ has a k-coloring each pair of whose colors appear… 
1971
1971
The interchromosomaldistributions of spontaneous achromatic lesions (AL) and chromatid breaks (B′) in human leukocytes in vitro… 
1969
1969
The intrachromatidal distributions of achromatic lesions (AL) and chromatid breaks (B′) on 10 sections of equal length of the…