Smaller planar triangle-free graphs that are not 3-list-colorable

A.N Glebov,A.V Kostochka,V.A Tashkinov

doi:10.1016/j.disc.2004.10.015

Smaller planar triangle-free graphs that are not 3-list-colorable

A.N Glebov, A.V Kostochka + Show 1 more

Open Access

https://doi.org/10.1016/j.disc.2004.10.015

Copy DOI

Journal: Discrete Mathematics	Publication Date: Jan 11, 2005
Citations: 10	License type: elsevier-specific

Affiliation: Sobolev Institute of Mathematics, University of Illinois Urbana-Champaign

#Planar Triangle-free Graph #Planar Graph + Show 2 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text