Title of article
Planar 4-critical graphs with four triangles
Author/Authors
Borodin، نويسنده , , Oleg V. and Dvo??k، نويسنده , , Zden?k and Kostochka، نويسنده , , Alexandr V. and Lidick?، نويسنده , , Bernard and Yancey، نويسنده , , Matthew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
14
From page
138
To page
151
Abstract
By the Grünbaum–Aksenov Theorem (extending Grötzsch’s Theorem) every planar graph with at most three triangles is 3 -colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such graphs. This answers a question of Erdős from 1990.
Journal title
European Journal of Combinatorics
Serial Year
2014
Journal title
European Journal of Combinatorics
Record number
1546664
Link To Document