𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

✍ Scribed by Zhi-wen Wang; Li-hong Yan; Zhong-fu Zhang

Book ID
106301253
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2007
Tongue
English
Weight
119 KB
Volume
23
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the vertex face total chromatic numbe
On the vertex face total chromatic number of planar graphs
✍ Weifan, Wang; Jiazhuang, Liu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 471 KB πŸ‘ 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for