Subcubic planar graphs of girth 7 are class I

被引：2
|
作者：
Bonduelle, Sebastien [1 ]
Kardos, Frantisek [2 ,3 ]
机构：
[1] ENS Rennes, Rennes, France
[2] Comenius Univ, Bratislava, Slovakia
[3] Univ Bordeaux, CNRS, LaBRI, F-33400 Talence, France
来源：
DISCRETE MATHEMATICS | 2022年 / 345卷 / 10期
关键词：
Planar graph; Subcubic graph; Edge coloring; MAXIMUM DEGREE-7; NP-COMPLETENESS;
D O I：
10.1016/j.disc.2022.113002
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove that planar graphs of maximum degree 3 and of girth at least 7 are 3-edge-colorable, extending the previous result for girth at least 8 by Kronk, Radlowski, and Franen from 1974. (C) 2022 Published by Elsevier B.V.
引用
收藏
页数：6
相关论文
共 50 条
  • [1] Choosability of the square of planar subcubic graphs with large girth
    Havet, F.
    DISCRETE MATHEMATICS, 2009, 309 (11) : 3553 - 3563
  • [2] Injective choosability of subcubic planar graphs with girth 6
    Brimkov, Boris
    Edmond, Jennifer
    Lazar, Robert
    Lidicky, Bernard
    Messerschmidt, Kacy
    Walker, Shanise
    DISCRETE MATHEMATICS, 2017, 340 (10) : 2538 - 2549
  • [3] INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
    Bu, Yuehua
    Lu, Kai
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (02)
  • [4] 2-DISTANCE 4-COLORABILITY OF PLANAR SUBCUBIC GRAPHS WITH GIRTH AT LEAST 22
    Borodin, Oleg V.
    Ivanova, Anna O.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2012, 32 (01) : 141 - 151
  • [5] Independent domination in subcubic graphs of girth at least six
    Abrishami, Gholamreza
    Henning, Michael A.
    DISCRETE MATHEMATICS, 2018, 341 (01) : 155 - 164
  • [6] The square of every subcubic planar graph of girth at least 6 is 7-choosable
    Kim, Seog-Jin
    Lian, Xiaopan
    DISCRETE MATHEMATICS, 2024, 347 (06)
  • [7] Induced Matchings in Subcubic Planar Graphs
    Kang, Ross J.
    Mnich, Matthias
    Mueller, Tobias
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 112 - +
  • [8] The Planar Slope Number of Subcubic Graphs
    Di Giacomo, Emilio
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 132 - 143
  • [9] INDUCED MATCHINGS IN SUBCUBIC PLANAR GRAPHS
    Kang, Ross J.
    Mnich, Matthias
    Muller, Tobias
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1383 - 1411
  • [10] AN ORIENTED 7-COLOURING OF PLANAR GRAPHS WITH GIRTH AT LEAST 7
    Borodin, O. V.
    Ivanova, A. O.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 222 - 229
12345