✦ LIBER ✦

Harmonious coloring of trees with large maximum degree

✍ Scribed by Saieed Akbari; Jaehoon Kim; Alexandr Kostochka

Book ID: 113567608
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 217 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.02.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Total colorings of planar graphs with la

Total colorings of planar graphs with large maximum degree

✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 3 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.

Fractional Path Coloring in Bounded Degr

Fractional Path Coloring in Bounded Degree Trees with

✍ I. Caragiannis; A. Ferreira; C. Kaklamanis; S. Pérennes; H. Rivano 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 715 KB

Maximum energy trees with two maximum de

Maximum energy trees with two maximum degree vertices

✍ Xueliang Li; Xiangmei Yao; Jianbin Zhang; Ivan Gutman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 370 KB

Equitable Total Coloring of Graphs with

Equitable Total Coloring of Graphs with Maximum Degree 3

✍ Wei-Fan Wang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 120 KB

Acyclic edge coloring of graphs with max

Acyclic edge coloring of graphs with maximum degree 4

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conj

Total coloring of planar graphs with max

Total coloring of planar graphs with maximum degree 8

✍ Wang, Huijuan; Wu, Lidong; Wu, Jianliang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 289 KB