✦ LIBER ✦

The equitable total chromatic number of the graphHM(Wn)

✍ Scribed by Haiying Wang; Jianxin Wei

Book ID: 105626329
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 217 KB
Volume: 24
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02832320

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Distinguishing Equitable Total Ch

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

✍ Zhi-wen Wang; Li-hong Yan; Zhong-fu Zhang 📂 Article 📅 2007 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 119 KB

A Bound on the Total Chromatic Number

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 481 KB

Recent results on the total chromatic nu

Recent results on the total chromatic number

✍ A.J.W. Hilton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Hilton, A.J.W., Recent results on the total chromatic number, Discrete Mathematics 111 (1993) 323-331. We give a survey of various recent results concerning the total chromatic number of simple graphs.

The total chromatic number of pseudo-out

The total chromatic number of pseudo-outerplanar graphs

✍ Wang Weifan; Zhang Kemin 📂 Article 📅 1997 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 404 KB

An upper bound for the total chromatic n

An upper bound for the total chromatic number

✍ H. R. Hind 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 379 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