DocumentCode
2464698
Title
Seeing the Equitable Colorings in a Different View
Author
Wenyu Zhang ; Wu Jichang ; Wu Jianliang
Author_Institution
Sch. of Mathematic, Shandong Univ., Jinan, China
Volume
3
fYear
2010
fDate
16-17 Dec. 2010
Firstpage
268
Lastpage
270
Abstract
A proper coloring of a graph is equitable if the sizes of any two color classes differ by at most one. We begin by the equitable colorings of the tree, and then add the edges to it, becoming various graphs with cycles. After that we classify them according to their characters, then work out the equitable colorings of these graphs respectively.
Keywords
graph colouring; trees (mathematics); equitable coloring; graph coloring; tree coloring; Bipartite graph; Color; Educational institutions; Electronic mail; Integrated circuits; Probes; Search methods; Cycl; Equitable coloring; Tree;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems (GCIS), 2010 Second WRI Global Congress on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-9247-3
Type
conf
DOI
10.1109/GCIS.2010.107
Filename
5709372
Link To Document