𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs

✍ Scribed by Gyárfás, András; Király, Zoltán; Lehel, Jeno

Book ID
118198946
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
460 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangle-free four-chromatic graphs
Triangle-free four-chromatic graphs
✍ Guoping Jin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 640 KB

For given n, let G be a triangle-free graph of order n with chromatic number at least 4. In this paper, we shall prove a conjecture of H/iggkvist by determining the maximal value of 6(G).

On minimal 5-chromatic triangle-free gra
On minimal 5-chromatic triangle-free graphs
✍ David Avis 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract It is shown that the minimum number of vertices in a triangle‐free 5‐chromatic graph is at least 19.

Still another triangle-free infinite-chr
Still another triangle-free infinite-chromatic graph
✍ A. Gyárfás 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 48 KB

We give a new example of a triangle-free =-chromatic graph: the vertices of G form a WX 00 matrix, V(G) = [S,j], i,. i = 1,2, . . . The vertex Ui,j is connected with every vertex of the (i + j)th column. G is triangle-free: if A has the smallest column-index among {A, B, C} c V(G) and AB, ACE E(G),