Acyclic colourings of planar graphs with large girth

被引：54
|
作者：
Borodin, OV [1 ]
Kostochka, AV
Woodall, DR
机构：
[1] Russian Acad Sci, Inst Math, Novosibirsk 630090, Russia
[2] Novosibirsk State Univ, Novosibirsk 630090, Russia
[3] Univ Nottingham, Dept Math, Nottingham NG7 2RD, England
来源：
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES | 1999年 / 60卷
基金：
英国工程与自然科学研究理事会;
关键词：
D O I：
10.1112/S0024610799007942
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A proper vertex-colouring of a graph is acidic if there are no 2-coloured cycles. It is known that every planar graph is acyclically 5-colourable. and that there are planar graphs with acyclic chromatic number chi (a) = 5 and girth g = 4. It is proved here that a planar graph satisfies chi (a) less than or equal to 4 if g greater than or equal to 5 and chi less than or equal to 3 if g greater than or equal to 7.
引用
收藏
页码：344 / 352
页数：9
相关论文
共 50 条
  • [31] Strong edge-coloring for planar graphs with large girth
    Chen, Lily
    Deng, Kecai
    Yu, Gexin
    Zhou, Xiangqian
    DISCRETE MATHEMATICS, 2019, 342 (02) : 339 - 343
  • [32] Complexity dichotomy for oriented homomorphism of planar graphs with large girth
    Guegan, Guillaume
    Ochem, Pascal
    THEORETICAL COMPUTER SCIENCE, 2015, 596 : 142 - 148
  • [33] Minimal identifying codes in trees and planar graphs with large girth
    Auger, David
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (05) : 1372 - 1384
  • [34] List improper colourings of planar graphs
    Skrekovski, R
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (03): : 293 - 299
  • [35] k-forested coloring of planar graphs with large girth
    Zhang, Xin
    Liu, Guizhen
    Wu, Jian-Liang
    PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2010, 86 (10) : 169 - 173
  • [36] Acyclic improper colourings of graphs with bounded maximum degree
    Addario-Berry, Louigi
    Esperet, Louis
    Kang, Ross J.
    McDiarmid, Colin J. H.
    Pinlou, Alexandre
    DISCRETE MATHEMATICS, 2010, 310 (02) : 223 - 229
  • [37] Acyclic coloring of graphs with some girth restriction
    Jiansheng Cai
    Binlu Feng
    Guiying Yan
    Journal of Combinatorial Optimization, 2016, 31 : 1399 - 1404
  • [38] Acyclic coloring of graphs with some girth restriction
    Cai, Jiansheng
    Feng, Binlu
    Yan, Guiying
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1399 - 1404
  • [39] n-Tuple Coloring of Planar Graphs with Large Odd Girth
    William Klostermeyer
    Cun Quan Zhang
    Graphs and Combinatorics, 2002, 18 : 119 - 132
  • [40] The coloring game on planar graphs with large girth, by a result on sparse cactuses
    Charpentier, Clement
    DISCRETE MATHEMATICS, 2017, 340 (05) : 1069 - 1073
12345