✦ LIBER ✦

On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3

✍ Scribed by Haiying Wang

Publisher: Springer US
Year: 2007
Tongue: English
Weight: 466 KB
Volume: 14
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9038-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the adjacent vertex d

An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph

✍ Xin-sheng Liu; Ming-qiang An; Yang Gao 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 159 KB

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

The Determination of the Total Chromatic

The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4

✍ Shu-Dong Wang; Shan-Chen Pang 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 126 KB

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.