✦ LIBER ✦

Isomorphism of two infinite-chromatic triangle-free graphs

✍ Scribed by Zsolt Tuza

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 125 KB
Volume: 69
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90181-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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),

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.

A triangle-free circle graph with chroma

A triangle-free circle graph with chromatic number 5

✍ A.A. Ageev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 170 KB

It follows from the results of , Gyirfis and Lehel (1985), and Kostochka (1988) that 4 ~x\* ## ~5 where x\* = max {X(G): G is a triangle-free circle graph}. We show that X\* ? 5 and thus X\* = 5. This disproves the conjecture of Karapetyan that X\* = 4 and answers negatively a question of Gyirfis

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

The fractional chromatic number of infin

The fractional chromatic number of infinite graphs

✍ Imre Leader 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 398 KB 👁 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g