Further results on the lower bounds of m
β
F. M. Dong
π
Article
π
2004
π
John Wiley and Sons
π
English
β 181 KB
π 1 views
Let G be a graph with n vertices. The mean color number of G, denoted by (G), is the average number of colors used in all n-colorings of G. This paper proves that (G) ! (Q), where Q is any 2-tree with n vertices and G is any graph whose vertex set has an ordering x 1 ,x 2 , . . . ,x n such that x i