中文

距离小于3处无$5^{-}$-圈的平面图是$(\mathcal{I}, \mathcal{F})$-可着色的

组合数学 2023-11-07 v1

摘要

若图的顶点集可划分为两个子集,其中一个为独立集,另一个导出一片森林,则称该图是(I,F)(\mathcal{I}, \mathcal{F})-可着色的。本文证明:每个在距离小于33处无55^{-}-圈的平面图都是(I,F)(\mathcal{I}, \mathcal{F})-可着色的。

关键词

引用

@article{arxiv.2311.02969,
  title  = {Planar graphs without $5^{-}$-cycles at distance less than $3$ are $(\mathcal{I}, \mathcal{F})$-colorable},
  author = {Zhen He and Tao Wang and Xiaojing Yang},
  journal= {arXiv preprint arXiv:2311.02969},
  year   = {2023}
}

备注

11 pages, 3 figures