当前位置: X-MOL 学术J. Comb. Theory B › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the average degree of edge chromatic critical graphs
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-05-05 , DOI: 10.1016/j.jctb.2020.04.004
Yan Cao , Guantao Chen

Let G be a simple graph, and let χ(G) and Δ(G) denote the chromatic index and the maximum degree of G, respectively. A graph G is a critical class two graph if χ(G)=Δ(G)+1 and χ(H)Δ(G) for every proper subgraph H of G. Let d(G) denote the average degree of G, i.e., d(G)=2|E(G)|/|V(G)|. Vizing in 1968 conjectured that d(G)Δ(G)1+3/n if G is a critical class two graph of order n. In this paper, we prove that d(G)34Δ(G)8 if G is a critical class two graph. Let δ(G) denote the minimum degree of G. We show that there exist two functions D and D0 such that for any ϵ(0,1), if G is a critical class two graph with Δ(G)D(ϵ) and δ(G)D0(ϵ), then d(G)(1ϵ)Δ(G). We will give two specific functions satisfying the statement above in the paper. Moreover, we show that if G is a critical class two graph and δ(G)(logΔ(G))34, then d(G)Δ(G)o(Δ(G)).



中文翻译:

关于边缘色临界图的平均度

G为简单图形,令χGΔG表示色指数最大程度ģ分别。的曲线图G ^是一个关键的类中的两个曲线图,如果χG=ΔG+1个χHΔG为每个子图正确ħģ。让dG表示平均度G ^,即dG=2|ËG|/|VG|。1968年的Vizing推测dGΔG-1个+3/ñ如果Gn阶的临界二类图。在本文中,我们证明dG34ΔG-8如果G是关键的二级图。让δG表示最小程度ģ。我们证明存在两个函数Dd0 这样对于任何 ϵ01个,如果G是具有ΔGdϵδGd0ϵ, 然后 dG1个-ϵΔG。我们将提供两个特定功能来满足本文中的上述要求。而且,我们证明了如果G是一个关键类2图δG日志ΔG34, 然后 dGΔG-ØΔG

更新日期:2020-05-05
down
wechat
bug