Total coloring of outer-1-planar graphs with near-independent crossings

被引:0
|
作者
Xin Zhang
机构
[1] Xidian University,School of Mathematics and Statistics
来源
关键词
Outerplanar graph; Outer-1-planar graph; Local structure; Total coloring;
D O I
暂无
中图分类号
学科分类号
摘要
A graph G is outer-1-planar with near-independent crossings if it can be drawn in the plane so that all vertices are on the outer face and |MG(c1)∩MG(c2)|≤1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|M_G(c_1)\cap M_G(c_2)|\le 1$$\end{document} for any two distinct crossings c1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_1$$\end{document} and c2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_2$$\end{document} in G, where MG(c)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M_G(c)$$\end{document} consists of the end-vertices of the two crossed edges that generate c. In Zhang and Liu (Total coloring of pseudo-outerplanar graphs, arXiv:1108.5009), it is showed that the total chromatic number of every outer-1-planar graph with near-independent crossings and with maximum degree at least 5 is Δ+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta +1$$\end{document}. In this paper we extend the result to maximum degree 4 by proving that the total chromatic number of every outer-1-planar graph with near-independent crossings and with maximum degree 4 is exactly 5.
引用
收藏
页码:661 / 675
页数:14
相关论文
共 50 条
  • [1] Total coloring of outer-1-planar graphs with near-independent crossings
    Zhang, Xin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (03) : 661 - 675
  • [2] Incidence Coloring of Outer-1-planar Graphs
    Meng-ke QI
    Xin ZHANG
    Acta Mathematicae Applicatae Sinica, 2024, 40 (03) : 840 - 848
  • [3] Incidence Coloring of Outer-1-planar Graphs
    Qi, Meng-ke
    Zhang, Xin
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2024, 40 (03): : 840 - 848
  • [4] List Edge Coloring of Outer-1-planar Graphs
    Zhang, Xin
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2020, 36 (03): : 737 - 752
  • [5] List Edge Coloring of Outer-1-planar Graphs
    Xin ZHANG
    Acta Mathematicae Applicatae Sinica, 2020, 36 (03) : 737 - 752
  • [6] List Edge Coloring of Outer-1-planar Graphs
    Xin Zhang
    Acta Mathematicae Applicatae Sinica, English Series, 2020, 36 : 737 - 752
  • [7] On list r -hued coloring of outer-1-planar graphs ?
    Liang, Lingmei
    Liu, Fengxia
    Lai, Hong-Jian
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 440
  • [8] Conflict-free Incidence Coloring of Outer-1-planar Graphs
    Qi, Meng-ke
    Zhang, Xin
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2024, 40 (04): : 929 - 942
  • [9] Light triangles in plane graphs with near-independent crossings
    Tian, Jingjing
    Zhang, Xin
    UTILITAS MATHEMATICA, 2015, 97 : 399 - 405
  • [10] The structure and the list 3-dynamic coloring of outer-1-planar graphs
    Li, Yan
    Zhang, Xin
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (03):