✦ LIBER ✦

Triangle-free -free graphs are 4-colorable

✍ Scribed by Pyatkin, Artem V.

Book ID: 123028524
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 310 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.10.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Class of Three-Colorable Triangle-Free

A Class of Three-Colorable Triangle-Free Graphs

✍ Marko Radovanović; Kristina Vušković 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

Oriented colorings of triangle-free plan

Oriented colorings of triangle-free planar graphs

✍ Pascal Ochem 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Fast 3-coloring Triangle-Free Planar Gra

Fast 3-coloring Triangle-Free Planar Graphs

✍ Lukasz Kowalik 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 546 KB

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

Packing Triangles inK4-Free Graphs

✍ Shunchang Huang, Lingsheng Shi 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 155 KB

A Note on HeterochromaticC4in Edge-Color

A Note on HeterochromaticC4in Edge-Colored Triangle-Free Graphs

✍ Guanghui Wang, Hao Li, Yan Zhu, Guizhen Liu 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 135 KB