中文

无短奇圈的平面图5-着色重构

组合数学 2024-12-06 v3

摘要

着色重构图Ck(G)\mathcal{C}_k(G)GG的所有正常kk-着色为其顶点集,若Ck(G)\mathcal{C}_k(G)中两个顶点对应的kk-着色仅在一个顶点上不同,则它们相邻。Cereceda猜想,若一个nn-顶点图GGdd-退化的且kd+2k\geq d+2,则Ck(G)\mathcal{C}_k(G)的直径为O(n2)O(n^2)。Bousquet和Heinrich证明了若GG是平面图且二部的,则C5(G)\mathcal{C}_5(G)的直径为O(n2)O(n^2)。(这证明了该猜想对每一个退化度为3的此类图成立。)他们还强调了当GG是平面图且无3-圈时Cereceda猜想的特殊情形。作为该问题的一个部分解,我们证明了对于每一个无3-圈且无5-圈的平面图GGC5(G)\mathcal{C}_5(G)的直径为O(n2)O(n^2)

关键词

引用

@article{arxiv.2208.02228,
  title  = {5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles},
  author = {Daniel W. Cranston and Reem Mahmoud},
  journal= {arXiv preprint arXiv:2208.02228},
  year   = {2024}
}

备注

7 pages, 3 figures, corrects a few errors in the previous version