A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable

作者：Wang De Qiang^*; Wen Yu Peng; Wang Ke Lun

来源：Information Processing Letters, 2008, 108(3): 87-89.

DOI：10.1016/j.ipl.2008.04.004

• Combinatorial problems
• Planar graph
• List coloring
• 3-choosable

In 2006, Montassier et al. constructed a planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable [M. Montassier, A. Raspaud, W. Wang, Bordeaux 3-color conjecture and 3-choosability, Discrete Math. 306 (2006) 573-579]. It has 506 vertices. In this paper, we construct a smaller planar graph with the same properties. The planar graph has 380 vertices.

• 出版日期2008-10-16
• 单位大连海事大学