On the Equitable Coloring of Halin Graphs
碩士 === 國立臺灣大學 === 數學研究所 === 93 === 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 adj...
Main Authors: | Pi-Hsia Hung, 洪碧霞 |
---|---|
Other Authors: | 李國偉 |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/18355132191326757520 |
Similar Items
-
Game chromatic number of Halin graphs
by: Jiao-Jiao Wu, et al.
Published: (2001) -
On the Laplacian spectral radii of Halin graphs
by: Huicai Jia, et al.
Published: (2017-04-01) -
The locating-chromatic number for Halin graphs
by: I.A. Purwasih, et al.
Published: (2017-01-01) -
The strong chromatic index of Halin graphs
by: Hu, Ziyu
Published: (2015) -
On Equitable Coloring of Graphs
by: Peng-Wei Wang, et al.