Choosability of the square of planar subcubic graphs with large girth

被引：19
|
作者：
Havet, F. [1 ]
机构：
[1] INRIA Sophia Antipolis, UNSA, CNRS, Projet Mascotte, F-06902 Sophia Antipolis, France
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 11期
关键词：
List colouring; Square of a graph; Bounded density; Planar graph;
D O I：
10.1016/j.disc.2007.12.100
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that the choice number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choice number of the square of a subcubic planar graph with girth at least 9 is at most 6. We then show that the choice number of the square of a subcubic planar graph with girth at least 13 is at most 5. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：3553 / 3563
页数：11
相关论文
共 50 条
  • [41] A Note on Group Choosability of Graphs with Girth at least 4
    Omidi, G. R.
    GRAPHS AND COMBINATORICS, 2011, 27 (02) : 269 - 273
  • [42] The Planar Slope Number of Subcubic Graphs
    Di Giacomo, Emilio
    Liotta, Giuseppe
    Montecchiani, Fabrizio
    LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 132 - 143
  • [43] Choosability and edge choosability of planar graphs without intersecting triangles
    Wang, WF
    Lih, KW
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2002, 15 (04) : 538 - 545
  • [44] INDUCED MATCHINGS IN SUBCUBIC PLANAR GRAPHS
    Kang, Ross J.
    Mnich, Matthias
    Muller, Tobias
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1383 - 1411
  • [45] A note on choosability with separation for planar graphs
    Skrekovski, R
    ARS COMBINATORIA, 2001, 58 : 169 - 174
  • [46] Choosability and edge choosability of planar graphs without five cycles
    Wang, WF
    Lih, KW
    APPLIED MATHEMATICS LETTERS, 2002, 15 (05) : 561 - 565
  • [47] Independent domination in subcubic bipartite graphs of girth at least six
    Henning, Michael A.
    Löwenstein, Christian
    Rautenbach, Dieter
    Discrete Applied Mathematics, 2014, 162 : 399 - 403
  • [48] Independent domination in subcubic bipartite graphs of girth at least six
    Rautenbach, D. (dieter.rautenbach@uni-ulm.de), 1600, Elsevier B.V., Netherlands (162):
  • [49] Strong edge-coloring for planar graphs with large girth
    Chen, Lily
    Deng, Kecai
    Yu, Gexin
    Zhou, Xiangqian
    DISCRETE MATHEMATICS, 2019, 342 (02) : 339 - 343
  • [50] Independent domination in subcubic bipartite graphs of girth at least six
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 399 - 403
12345