arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.15908math.COcs.DM
收藏

关于具有禁用诱导鱿鱼或公牛的 k-顶点临界 2P2-自由图的有限性

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls

Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel

AI总结:

本文证明当禁用诱导子图 H 为 bull、chair、claw+P1、overline{diamond+P1} 或特定 squid 时,所有 k 的 k-顶点临界 (2P2,H)-自由图仅有有限多个,并据此给出多项式时间认证算法及小规模图的穷举生成结果。

摘要:

一个图被称为 k-顶点临界图,如果 χ(G)=k 但对所有 v∈V(G) 都有 χ(G-v)<k;一个图被称为 (G,H)-自由图,如果它不包含同构于 G 或 H 的诱导子图。我们证明,当 H 同构于以下任意一个 5 阶图时:bull、chair、claw+P1 或 \overline{diamond+P1},对所有 k 仅存在有限多个 k-顶点临界 (2P2,H)-自由图。后三个结果是更一般结果的推论,其中 H 同构于 (m,ℓ)-squid,m=3,4 且任意 ℓ≥1,这里 (m,ℓ)-squid 是通过在 m-圈的一个顶点上附加 ℓ 个叶子而得到的图。对于上述每个图 H 以及任意固定的 k,我们的结果意味着存在多项式时间的认证算法,用于判定 (2P2,H)-自由图的 k-可着色性问题。此外,我们的结构分类使我们能够在计算机搜索的辅助下穷举生成所有 k-顶点临界 (2P2,H)-自由图,其中 k≤7,当 H=bull 或 H=(4,1)-squid(也称为 banner)时。

英文摘要:

A graph is $k$-vertex-critical if $χ(G)=k$ but $χ(G-v)<k$ for all $v\in V(G)$ and $(G,H)$-free if it contains no induced subgraph isomorphic to $G$ or $H$. We show that there are only finitely many $k$-vertex-critical $(2P_2,H)$-free graphs for all $k$ when $H$ is isomorphic to any of the following graphs of order $5$: $bull$, $chair$, $claw+P_1$, or $\overline{diamond+P_1}$. The latter three are corollaries of more general results where $H$ is isomorphic to $(m, \ell)$-$squid$ for $m=3,4$ and any $\ell\ge 1$ where an $(m,\ell)$-$squid$ is the graph obtained from an $m$-cycle by attaching $\ell$ leaves to a single vertex of the cycle. For each of the graphs $H$ above and any fixed $k$, our results imply the existence of polynomial-time certifying algorithms for deciding the $k$-colourability problem for $(2P_2,H)$-free graphs. Further, our structural classifications allow us to exhaustively generate, with aid of computer search, all $k$-vertex-critical $(2P_2,H)$-free graphs for $k\le 7$ when $H=bull$ or $H=(4,1)$-$squid$ (also known as $banner$).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑