An improvement to the Hilton-Zhao vertex-splitting conjecture

An improvement to the Hilton-Zhao vertex-splitting conjecture
复制标题

Hilton-Zhao顶点分裂猜想的改进

DOI:
10.1016/j.disc.2022.112902
复制
发表时间:
2022
影响因子:
0.8
通讯作者:
Shan, Songling
Shan, Songling
中科院分区:
数学3区
文献类型:
--
作者:
Cao, Yan;Chen, Guantao;Shan, Songling

文献摘要

参考文献

被引文献

相似文献

对于简单图G,分别用n,Δ(G)和χ′(G)表示其阶,最大度和色指数.如果对图G的每个真子图H,χ′(G)= Δ(G)+ 1且χ′(H)< χ′(G),则称图G是边色临界的.设G是一个n点连通的正则1类图,G是G的一个顶点分裂成两个顶点的结果.希尔顿和Zhao在1997年证明了当Δ(G)> n/3时G是边色临界的,并且当Δ(G)≥ n2(7− 1)<$0.82 n时证明了这一点。本文证明了当Δ(G)≥ 0.75n时,它是存在的.
For a simple graph G, denote by n, Δ (G), and χ′(G) its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if χ′(G)= Δ (G)+ 1 and χ′(H)< χ′(G) for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let G⁎ be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that G⁎ must be edge-chromatic critical if Δ (G)> n/3, and they verified this when Δ (G)≥ n 2 (7− 1)≈ 0.82 n. In this paper, we prove it for Δ (G)≥ 0.75 n.
Yap 的 β 临界图构造的进一步扩展
DOI: 10.1016/s0012-365x(01)00230-8
发表时间: 2002
期刊: Discret. Math.
影响因子: --
作者:
Zi
通讯作者: Zi
DOI: 10.1007/s00373-014-1512-3
发表时间: 2015
影响因子: 0.7
作者:
A. Vietri
通讯作者: A. Vietri
用于获得边缘关键图的莫比乌斯型粘合技术
DOI: 10.26493/1855-3974.2039.efc
发表时间: 2020
期刊: Ars Math. Contemp.
影响因子: --
作者:
S. Bonvicini;A. Vietri
通讯作者: A. Vietri
DOI: 10.1016/s0166-218x(96)00125-4
发表时间: 1997-06-13
影响因子: 1.1
作者:
Hilton, AJW;Zhao, C
通讯作者: Zhao, C