期刊论文

Chen, Xiaodong

英文

Discrete Mathematics

0012-365X

2017

340

12

3011-3015

10.1016/j.disc.2017.07.013

This research is supported by National Natural Science Foundation of China (Grant No. 61572095 , No. 51405214 ); National Natural Science Foundation of China Tian Yuan Special Foundation (Grant No. 11426125 ); The Joint Fund of Liaoning Province Natural Science Foundation (Grant No. SY2016012 ).

本校为其他机构

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order n with maximum degree at least [Formula presented] is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order n with maximum degree at least [Formula presented] is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order n with maximum degree at least...