Exact Coloring

In graph theory, an exact coloring is a (proper) vertex coloring in which every pair of colors appears on exactly one pair of adjacent vertices. In essence, an exact coloring is a coloring that is both harmonious and complete. Graphs that admit exact colorings have been classified.

External links

http://www.maths.dundee.ac.uk/~kedwards/biblio.html A Bibliography of Harmonious Colourings and Achromatic Number by Keith Edwards

 

<< PreviousWord BrowserNext >>
football association of bosnia and herzegovina
lee arenberg
stadium kosevo
seattle art museum
mirsad fazlagic
list edge coloring
cable & deadpool
seattle preparatory school
zig zag
one night stand
rose marie
pousse cafe
asim ferhatovic
total coloring
comic opera
safet susic
twister (hack)
operation desert lion
zabranjeno puenje
sergej barbarez
harmonious coloring
gbadolite
amy acker
complete coloring
ashley hammond
tracy lynn cruz
thabana ntlenyana
earl newton
playback
pedrarias dvila
abhishekh bachhan
differential analyser
champagne castle
sultanate of sulu
grnaln
francisco oller
acyclic coloring
giant's castle
strong coloring
grmsvtn
cempedak
garfield barwick
ben macdhui
2c c