On the Equitable Coloring of Halin Graphs
Date Issued
2005
Date
2005
Author(s)
Hung, Pi-Hsia
DOI
en-US
Abstract
A Halin graph is a planar graph consisting of a tree with no vertex of degree two and a cycly connecting the leaves of the tree. We write . A graph is said to be equitably -colorable if the vertices of is colored with colors such that there are no two adjacent vertices of the same color and the size of the color classes differ by at most one. Let be the maximum degree of a vertex in graph . Chen et al. conjectured that a connected graph is equitable -colorable if is not a complete graph , or an odd cycle , or a complete bipartite graph for all . In this thesis, we prove that any Halin graph except has an equitable -coloring.
Subjects
均勻著色
equitable coloring
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R91221022-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):5a6f9f4b6b0d8a1fbd9d60fb8296ef27