✦ LIBER ✦

Acyclic total colorings of planar graphs withoutlcycles

✍ Scribed by Xiang Yong Sun; Jian Liang Wu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2011
Tongue: English
Weight: 194 KB
Volume: 27
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-011-8640-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic colorings of planar graphs

✍ Wayne Goddard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Acyclic list 7-coloring of planar graphs

✍ O. V. Borodin; D. G. Fon-Der Flaass; A. V. Kostochka; A. Raspaud; E. Sopena 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

Total Colorings of Planar Graphs without

Total Colorings of Planar Graphs without Small Cycles

✍ Jianfeng Hou; Yan Zhu; Guizhen Liu; Jianliang Wu; Mei Lan 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 197 KB

Acyclic edge colorings of graphs

✍ Noga Alon; Benny Sudakov; Ayal Zaks 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __a′__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __a′__(_

Acyclic edge coloring of triangle-free p

Acyclic edge coloring of triangle-free planar graphs

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB 👁 2 views

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 conjectured by Al

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.