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 条

[1] 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
[2] Circular choosability of planar graphs with large girth
Wang, Guanghui
Liu, Guizhen
ARS COMBINATORIA, 2011, 99 : 65 - 73
[3] Subcubic planar graphs of girth 7 are class I
Bonduelle, Sebastien
Kardos, Frantisek
DISCRETE MATHEMATICS, 2022, 345 (10)
[4] Injective choosability of planar graphs of girth five and six
Li, Rui
Xu, Baogang
DISCRETE MATHEMATICS, 2012, 312 (06) : 1260 - 1265
[5] Girth and ?-choosability of graphs
Gu, Yangyan
Zhu, Xuding
JOURNAL OF GRAPH THEORY, 2023, 103 (03) : 493 - 501
[6] Exact square coloring of subcubic planar graphs
Foucaud, Florent
Hocquard, Herve
Mishra, Suchismita
Narayanan, Narayanan
Naserasr, Reza
Sopena, Eric
Valicov, Petru
DISCRETE APPLIED MATHEMATICS, 2021, 293 : 74 - 89
[7] NSD Total Choosability of Planar Graphs with Girth at Least Four
Han, Xue
Wang, Jihui
Qiu, Baojian
PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND OPTIMIZATION TECHNOLOGIES AND APPLICATIONS (MSOTA2016), 2016, 58 : 78 - 80
[8] Acyclic improper choosability of subcubic graphs
Chen, Min
Raspaud, Andre
APPLIED MATHEMATICS AND COMPUTATION, 2019, 356 : 92 - 98
[9] Acyclic 4-choosability of planar graphs with girth at least 5
Montassier, Mickael
Graph Theory in Paris: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, : 299 - 310
[10] LIGHT GRAPHS IN PLANAR GRAPHS OF LARGE GIRTH
Hudak, Peter
Macekova, Maria
Madaras, Tomas
Siroczki, Pavol
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (01) : 227 - 238

← 1 2 3 4 5 →