𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complete chromatic number of Halin graphs

✍ Scribed by Zhongfu Zhang; Linzhong Liu


Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1997
Tongue
English
Weight
300 KB
Volume
13
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Edge-face chromatic number of Halin-grap
✍ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 50 KB
The strong chromatic index of complete c
✍ W.C. Shiu; W.K. Tam πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 809 KB

A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.

The vertex-face total chromatic number o
✍ Lam, Peter C. B.; Zhang, Zhongfu πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 69 KB πŸ‘ 2 views

In this paper, we shall first prove that for a Halin graph G, 4 Β°xT (G) Β°6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff

A note on the total chromatic number of
✍ Zhongfu Zhang; Linzhong Liu; Jianfang Wang; Hongxiang Li πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 210 KB

In this paper, we prove that XT(G) = 5 for any Halin graph G with A(G) = 4, where A(G) and XT(G) denote the maximal degree and the total chromatic number of G, respectively.

The binding number of Halin graphs
✍ MirosΕ‚awa SkowroΕ„ska πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 304 KB