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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18355132191326757520 |