中文

若干无冠图的染色

组合数学 2023-07-25 v1

摘要

GGHH 为两个顶点不交的图。{\em 并图} GHG\cup H 是指满足 V(GH)=V(G)(H)V(G\cup H)=V(G)\cup (H)E(GH)=E(G)E(H)E(G\cup H)=E(G)\cup E(H) 的图。{\em 联图} G+HG+H 是指满足 V(G+H)=V(G)+V(H)V(G+H)=V(G)+V(H)E(G+H)=E(G)E(H){xy    xV(G),yV(H)}E(G+H)=E(G)\cup E(H)\cup\{xy\;|\; x\in V(G), y\in V(H)\} 的图。我们用 PkP_k 表示具有 kk 个顶点的{\em 路},用{\em fork}表示由 K1,3K_{1,3} 通过将一条边细分一次所得的图,并用{\em crown}表示图 K1+K1,3K_1+K_{1,3}。本文中,我们证明:(1)若 GG 是(crown, P5P_5)自由的,则 χ(G)32(ω2(G)ω(G))\chi(G)\le\frac{3}{2}(\omega^2(G)-\omega(G));(2)若 GG 是(crown, fork)自由的,则 χ(G)12(ω2(G)+ω(G))\chi(G)\le\frac{1}{2}(\omega^2(G)+\omega(G));(3)若 GG 是(crown, P3P2P_3\cup P_2)自由的,则 χ(G)12ω2(G)+32ω(G)+1\chi(G)\le\frac{1}{2}\omega^2(G)+\frac{3}{2}\omega(G)+1

关键词

引用

@article{arxiv.2307.11946,
  title  = {Coloring_of_some_crown-free_graphs},
  author = {Di Wu and Baogang Xu},
  journal= {arXiv preprint arXiv:2307.11946},
  year   = {2023}
}

备注

arXiv admin note: text overlap with arXiv:2302.06800