Title of article
Smaller planar triangle-free graphs that are not 3-list-colorable
Author/Authors
A.N. Glebov، نويسنده , , A.V. Kostochka، نويسنده , , V.A. Tashkinov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
6
From page
269
To page
274
Abstract
In 1995, Voigt constructed a planar triangle-free graph that is not 3-list-colorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set of six colors, while the second has 109 vertices and a failing list assignment using triples from a set of five colors.
Keywords
Planar graphs , Triangle-free graphs , List coloring
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948521
Link To Document