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 and denote the chromatic index and the maximum degree of G, respectively. A graph G is a critical class two graph if and for every proper subgraph H of G. Let denote the average degree of G, i.e., . Vizing in 1968 conjectured that if G is a critical class two graph of order n. In this paper, we prove that if G is a critical class two graph. Let denote the minimum degree of G. We show that there exist two functions D and such that for any , if G is a critical class two graph with and , then . 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 , then .
中文翻译:
关于边缘色临界图的平均度
令G为简单图形,令 和 表示色指数和最大程度的ģ分别。的曲线图G ^是一个关键的类中的两个曲线图,如果 和 为每个子图正确ħ的ģ。让表示平均度的G ^,即。1968年的Vizing推测如果G是n阶的临界二类图。在本文中,我们证明如果G是关键的二级图。让表示最小程度的ģ。我们证明存在两个函数D和 这样对于任何 ,如果G是具有 和 , 然后 。我们将提供两个特定功能来满足本文中的上述要求。而且,我们证明了如果G是一个关键类2图, 然后 。