✦ LIBER ✦

Total colorings of planar graphs without intersecting 5-cycles

✍ Scribed by Bing Wang; Jian-Liang Wu

Book ID: 113564826
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 312 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.03.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Equitable colorings of planar graphs wit

Equitable colorings of planar graphs without short cycles

✍ Nakprasit, Keaitsuda; Nakprasit, Kittikorn 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs without 5-cycles

✍ Qiaojun Shu; Weifan Wang; Yiqiao Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Planar graphs with maximum degree 8 and

Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

✍ JianSheng Cai, GuangHui Wang, GuiYing Yan 📂 Article 📅 2012 🏛 SP Science China Press 🌐 English ⚖ 463 KB

Planar graph colorings without short mon

Planar graph colorings without short monochromatic cycles

✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract It is well known that every planar graph __G__ is 2‐colorable in such a way that no 3‐cycle of __G__ is monochromatic. In this paper, we prove that __G__ has a 2‐coloring such that no cycle of length 3 or 4 is monochromatic. The complete graph __K__~5~ does not admit such a coloring. On

Planar graphs with maximum degree 7 and

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

✍ Lan Shen; Yingqian Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 460 KB