Many 3-colorings of triangle-free planar graphs

被引：17
|
作者：
Thomassen, Carsten [1 ]
机构：
[1] Tech Univ Denmark, Dept Math, DK-2800 Lyngby, Denmark
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2007年 / 97卷 / 03期
关键词：
planar graphs; many; 3-colorings;
D O I：
10.1016/j.jctb.2006.06.005
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Grotzsch proved that every planar triangle-free graph is 3-colorable. We prove that it has at least 2(n1/2)/20000 distinct 3-colorings where n is the number of vertices. If the graph has girth at least 5, then it has at least 2(n/10000) distinct list-colorings provided every vertex has at least three available colors. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码：334 / 349
页数：16
相关论文
共 50 条
  • [41] On the evolution of triangle-free graphs
    Steger, A
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (1-2): : 211 - 224
  • [42] Triangle-free polyconvex graphs
    Isaksen, DC
    Robinson, B
    [J]. ARS COMBINATORIA, 2002, 64 : 259 - 263
  • [43] CYCLES IN TRIANGLE-FREE GRAPHS
    Li, Xiaojuan
    Wei, Bing
    Zhu, Yongjin
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (03) : 343 - 356
  • [44] The diagnosability of triangle-free graphs
    Lin, Cheng-Kuan
    Teng, Yuan-Hsiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 530 : 58 - 65
  • [45] Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Ochem, Pascal
    Pinlou, Alexandre
    [J]. GRAPHS AND COMBINATORICS, 2014, 30 (02) : 439 - 453
  • [46] TOUGHNESS AND TRIANGLE-FREE GRAPHS
    BAUER, D
    VANDENHEUVEL, J
    SCHMEICHEL, E
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 65 (02) : 208 - 221
  • [47] Counting Gallai 3-colorings of complete graphs
    Bastos, Josefran de Oliveira
    Benevides, Fabricio Siqueira
    Mota, Guilherme Oliveira
    Sau, Ignasi
    [J]. DISCRETE MATHEMATICS, 2019, 342 (09) : 2618 - 2631
  • [48] 3-CHOOSABILITY OF TRIANGLE-FREE PLANAR GRAPHS WITH CONSTRAINTS ON 4-CYCLES
    Dvorak, Zdenek
    Lidicky, Bernard
    Skrekovski, Riste
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) : 934 - 945
  • [49] 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
    Choi, Ilkyoo
    Ekstein, Jan
    Holub, Premysl
    Lidicky, Bernard
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 98 - 109
  • [50] THE SPECTRUM OF TRIANGLE-FREE GRAPHS
    Balogh, Jozsef
    Clemen, Felix Christian
    Lidick, Bernard
    Norin, Sergey
    Volec, Jan
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 1173 - 1179
12345