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 条
  • [1] Injective Colorings of Graphs with Low Average Degree
    Cranston, Daniel W.
    Kim, Seog-Jin
    Yu, Gexin
    ALGORITHMICA, 2011, 60 (03) : 553 - 568
  • [2] Unfriendly colorings of graphs with finite average degree
    Conley, Clinton T.
    Tamuz, Omer
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2021, 122 (02) : 229 - 233
  • [4] Injective colorings of sparse graphs
    Cranston, Daniel W.
    Kim, Seog-Jin
    Yu, Gexin
    DISCRETE MATHEMATICS, 2010, 310 (21) : 2965 - 2973
  • [5] Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree
    Huo, Jingjing
    Wen, Sensen
    Chen, Yulong
    Li, Mingchao
    AXIOMS, 2023, 12 (12)
  • [6] List injective colorings of planar graphs
    Borodin, O. V.
    Ivanova, A. O.
    DISCRETE MATHEMATICS, 2011, 311 (2-3) : 154 - 165
  • [7] Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree
    Dong, Aijun
    Zou, Qingsong
    Li, Guojun
    ARS COMBINATORIA, 2016, 124 : 303 - 311
  • [8] Injective colorings of planar graphs with few colors
    Luzar, Borut
    Skrekovski, Riste
    Tancer, Martin
    DISCRETE MATHEMATICS, 2009, 309 (18) : 5636 - 5649
  • [9] Oriented cliques and colorings of graphs with low maximum degree
    Dybizbanski, Janusz
    Ochem, Pascal
    Pinlou, Alexandre
    Szepietowski, Andrzej
    DISCRETE MATHEMATICS, 2020, 343 (05)
  • [10] Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Degree and Maximum Average Degree
    Qiu, Baojian
    Wang, Jihui
    Liu, Yan
    Xu, Zhenyu
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE) AND IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC), VOL 1, 2017, : 898 - 901