𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star chromatic number of triangle-free planar graphs

✍ Scribed by G.-G. Gao

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
323 KB
Volume
7
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The star-chromatic number of planar grap
The star-chromatic number of planar graphs
✍ Moser, David πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.

Star chromatic numbers of some planar gr
Star chromatic numbers of some planar graphs
✍ Gao, Guogang; Wang, Yiju; Zhou, Huishan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 173 KB πŸ‘ 2 views

The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla

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

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 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.