✦ LIBER ✦

A Class of Three-Colorable Triangle-Free Graphs

✍ Scribed by Marko Radovanović; Kristina Vušković

Book ID: 112121117
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 543 KB
Volume: 72
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21651

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oriented colorings of triangle-free plan

Oriented colorings of triangle-free planar graphs

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

A class of planar four-colorable graphs

✍ Ezra Brown; Lee Johnson 📂 Article 📅 1972 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 164 KB

Häggkvist–Hell graphs: A class of Kneser

Häggkvist–Hell graphs: A class of Kneser-colorable graphs

✍ David E. Roberson 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 343 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

Triangles in a complete chromatic graph

Triangles in a complete chromatic graph with three colors

✍ A.W Goodman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for