Injective Colorings of Graphs with Low Average Degree

被引:0
|
作者
Daniel W. Cranston
Seog-Jin Kim
Gexin Yu
机构
[1] Virginia Commonwealth University,Department of Mathematics & Applied Mathematics
[2] Rutgers University,DIMACS
[3] Konkuk University,undefined
[4] College of William and Mary,undefined
来源
Algorithmica | 2011年 / 60卷
关键词
Injective coloring; Discharging method; Maximum average degree; List coloring;
D O I
暂无
中图分类号
学科分类号
摘要
Let mad (G) denote the maximum average degree (over all subgraphs) of G and let χi(G) denote the injective chromatic number of G. We prove that if Δ≥4 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathrm{mad}(G)<\frac{14}{5}$\end{document}, then χi(G)≤Δ+2. When Δ=3, we show that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathrm{mad}(G)<\frac{36}{13}$\end{document} implies χi(G)≤5. In contrast, we give a graph G with Δ=3, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathrm{mad}(G)=\frac{36}{13}$\end{document}, and χi(G)=6.
引用
收藏
页码:553 / 568
页数:15
相关论文
共 50 条
  • [21] Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
    Department of Mathematics, Zhejiang Normal University, Zhejiang, Jinhua 321004, China
    J Combin Optim, 4 (471-485):
  • [22] Acyclic colorings of graphs with bounded degree
    Anna Fiedorowicz
    Elżbieta Sidorowicz
    Science China Mathematics, 2016, 59 : 1427 - 1440
  • [23] Acyclic colorings of graphs with bounded degree
    FIEDOROWICZ Anna
    SIDOROWICZ Elzbieta
    Science China(Mathematics), 2016, 59 (07) : 1427 - 1440
  • [24] Acyclic colorings of graphs with bounded degree
    Fiedorowicz, Anna
    Sidorowicz, Elizbieta
    SCIENCE CHINA-MATHEMATICS, 2016, 59 (07) : 1427 - 1440
  • [25] Backbone colorings of graphs with bounded degree
    Miskuf, Jozef
    Skrekovski, Riste
    Tancer, Martin
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 534 - 542
  • [26] Injective edge colorings of degenerate graphs and the oriented chromatic number
    Bradshaw, Peter
    Clow, Alexander
    Xu, Jingwei
    EUROPEAN JOURNAL OF COMBINATORICS, 2025, 127
  • [27] Neighbor Sum Distinguishing Colorings of Graphs with Maximum Average Degree Less Than 37/12
    Qiu, Bao Jian
    Wang, Ji Hui
    Liu, Yan
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2018, 34 (02) : 265 - 274
  • [28] Neighbor Sum Distinguishing Colorings of Graphs with Maximum Average Degree Less Than 37/12
    Bao Jian QIU
    Ji Hui WANG
    Yan LIU
    ActaMathematicaSinica, 2018, 34 (02) : 265 - 274
  • [29] Neighbor Sum Distinguishing Colorings of Graphs with Maximum Average Degree Less Than 37/12
    Bao Jian QIU
    Ji Hui WANG
    Yan LIU
    Acta Mathematica Sinica,English Series, 2018, (02) : 265 - 274
  • [30] Graphs of low average degree without independent transversals
    Groenland, Carla
    Kaiser, Tomas
    Treffers, Oscar
    Wales, Matthew
    JOURNAL OF GRAPH THEORY, 2023, 102 (02) : 374 - 387