Citation
Pcb. Lam et al., The 4-choosability of plane graphs without 4-cycles, J COMB TH B, 76(1), 1999, pp. 117-126
Citations number
11
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN journal
00958956
→ ACNP
Volume
76
Issue
1
Year of publication
1999
Pages
117 - 126
Database
ISI
SICI code
0095-8956(199905)76:1<117:T4OPGW>2.0.ZU;2-O
Abstract
A graph G is called k-choosable if k is a number such that if we give lists
of k colors to each vertex of G there is a vertex coloring of G where each
vertex receives a color from its own list no matter what the lists: are. I
n this paper, it is shown that each plane graph without 4-cycles is 4-choos
able. (C) 1999 Academic Press.