Article
3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
Australasian Journal of Combinatorics
(2009)
Abstract
A graph is k-choosable if it can be colored whenever every vertex has a
list of available colors of size at least k. It is a generalization of graph
coloring where all vertices do not have the same available colors. We
show that every triangle-free plane graph without 6-, 7-, and 8-cycles is
3-choosable.
Disciplines
Publication Date
2009
Publisher Statement
© Copyright 2014 Combinatorial Mathematics Society of Australasia (Inc.)
Any individual is entitled to download a copy of any paper from this site for purposes of individual study or research.
Citation Information
Bernard Lidicky. "3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles" Australasian Journal of Combinatorics Vol. 44 (2009) p. 77 - 86 Available at: http://works.bepress.com/bernard-lidicky/1/