Smaller planar triangle-free graphs that are not 3-list-colorable
From MaRDI portal
Publication:1772422
DOI10.1016/j.disc.2004.10.015zbMath1058.05022OpenAlexW2137523248MaRDI QIDQ1772422
V. A. Tashkinov, Alekseĭ Nikolaevich Glebov, Alexandr V. Kostochka
Publication date: 18 April 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.015
Related Items (6)
A note on the not 3-choosability of some families of planar graphs ⋮ On \(t\)-common list-colorings ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Multiple list colouring triangle free planar graphs
Cites Work
This page was built for publication: Smaller planar triangle-free graphs that are not 3-list-colorable