✦ LIBER ✦

The total coloring of a multigraph with maximal degree 4

✍ Scribed by A.V. Kostochka

Book ID: 107748255
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 196 KB
Volume: 17
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90146-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The total chromatic number of any multig

The total chromatic number of any multigraph with maximum degree five is at most seven

✍ A.V. Kostochka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.

On the size of edge-coloring critical gr

On the size of edge-coloring critical graphs with maximum degree 4

✍ Lianying Miao; Shiyou Pang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 187 KB

On the 7 Total Colorability of Planar Gr

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 168 KB

Coloring the hypergraph of maximal cliqu

Coloring the hypergraph of maximal cliques of a graph with no long path

✍ Sylvain Gravier; Chı́nh T. Hoàng; Frédéric Maffray 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 116 KB

A note on the total coloring of planar g

A note on the total coloring of planar graphs without adjacent 4-cycles

✍ Hui-Juan Wang; Jian-Liang Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 233 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.