✦ LIBER ✦

On the small graphs with chromatic number 5 without 4-cliques

✍ Scribed by Nedyalko D. Nenov

Book ID: 108316255
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 49 KB
Volume: 188
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00083-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Small graphs with chromatic number 5: A

Small graphs with chromatic number 5: A computer search

✍ Tommy Jensen; Gordon F. Royle 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract In this article we give examples of a triangle‐free graph on 22 vertices with chromatic number 5 and a __K__~4~‐free graph on 11 vertices with chromatic number 5. We very briefly describe the computer searches demonstrating that these are the smallest possible such graphs. All 5‐critica

On total chromatic number of planar grap

On total chromatic number of planar graphs without 4-cycles

✍ Ying-qian Wang; Min-le Shangguan; Qiao Li 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 166 KB

The size of graphs with clique number m

The size of graphs with clique number m and without nowhere-zero 4-flows

✍ Zhi-Hong Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 122 KB

On the number of graphs without 4-cycles

✍ Daniel J. Kleitman; Kenneth J. Winston 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 534 KB

A bound on the chromatic number of graph

A bound on the chromatic number of graphs without certain induced subgraphs

✍ Stanley Wagon 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 144 KB

On the connection between chromatic numb

On the connection between chromatic number, maximal clique and minimal degree of a graph

✍ B. Andrásfai; P. Erdös; V.T. Sós 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 606 KB