Complete Coloring
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 appears on at least one pair of adjacent vertices. The
achromatic number
ψ(G) of a graph G is the maximum number of colors needed for any complete coloring of G.
External links
http://www.maths.dundee.ac.uk/~kedwards/biblio.html
A Bibliography of Harmonious Colourings and Achromatic Number
by Keith Edwards
<< Previous
Word Browser
Next >>
parathion
list coloring
yugoslav first league
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
ashley hammond
tracy lynn cruz
exact coloring
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
Copyright 2005-2009 OnPedia.com. All Rights Reserved