𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-Face Total Chromatic Number of Halin Graphs

✍ Scribed by Chan, W. H.; Lam, Peter C. B.; Shiu, W. C.

Book ID
118197679
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
513 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-face chromatic number of Halin-grap
Edge-face chromatic number of Halin-graphs
✍ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 50 KB
The vertex-face total chromatic number o
The vertex-face total chromatic number of Halin graphs
✍ 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

Edge-face chromatic number and edge chro
Edge-face chromatic number and edge chromatic number of simple plane graphs
✍ Rong Luo; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function Ο• : __E__(__G__) βˆͺ __F__(G) →  {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) βˆͺ __F__(__G__), Ο•(__a__) ≠ ϕ(__b__). Let Ο‡~e~(__G__), Ο‡~ef~(__G__), and Ξ”(__G_

A note on the total chromatic number of
A note on the total chromatic number of Halin graphs with maximum degree 4
✍ 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.