Fractional coloring of triangle-free planar graphs

被引：0
|
作者：
Dvorak, Zdenek [1 ]
Sereni, Jean-Sebastien [2 ]
Volec, Jan [3 ,4 ]
机构：
[1] Charles Univ Prague, Inst Comp Sci, Prague, Czech Republic
[2] Ctr Natl Rech Sci LORIA, Nancy, France
[3] Univ Warwick, Inst Math, Coventry CV4 7AL, W Midlands, England
[4] Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands, England
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2015年 / 22卷 / 04期
关键词：
THEOREM;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3 - 3/3n+1 .
引用
收藏
页数：7
相关论文
共 50 条
  • [21] Coloring Triangle-Free Graphs and Network Games
    University of California, San Diego
  • [22] Distributed coloring algorithms for triangle-free graphs
    Pettie, Seth
    Su, Hsin-Hao
    INFORMATION AND COMPUTATION, 2015, 243 : 263 - 280
  • [23] Distributed coloring algorithms for triangle-free graphs
    University of Michigan, Ann Arbor
    MI
    48105, United States
    Inf Comput, (263-280):
  • [24] Coloring and Domination of Vertices in Triangle-free Graphs
    Dutton, Ronald
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 111 : 137 - 143
  • [25] Flexibility of triangle-free planar graphs
    Dvorak, Zdenek
    Masarik, Tomas
    Musilek, Jan
    Pangrac, Ondrej
    JOURNAL OF GRAPH THEORY, 2021, 96 (04) : 619 - 641
  • [26] Coloring of triangle-free graphs on the double torus
    Kral, Daniel
    Stehlik, Matej
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2008, 22 (02) : 541 - 553
  • [27] Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
    Dvorak, Zdenek
    Kral, Daniel
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 150 : 244 - 269
  • [28] 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
    Choi, Ilkyoo
    Ekstein, Jan
    Holub, Premysl
    Lidicky, Bernard
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 98 - 109
  • [29] Fast distributed coloring algorithms for triangle-free graphs
    Springer Verlag (7966 LNCS):
  • [30] Triangle-free planar graphs as segments intersection graphs
    de Castro, N
    Cobos, FJ
    Dana, JC
    Márquez, A
    Noy, M
    GRAPH DRAWING, 1999, 1731 : 341 - 350
12345