当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Hamiltonicity of edge-chromatic critical graphs
Discrete Mathematics ( IF 0.7 ) Pub Date : 2020-03-04 , DOI: 10.1016/j.disc.2020.111881 Yan Cao , Guantao Chen , Suyun Jiang , Huiqing Liu , Fuliang Lu
中文翻译:
边色临界图的汉密尔顿性
更新日期:2020-03-05
Discrete Mathematics ( IF 0.7 ) Pub Date : 2020-03-04 , DOI: 10.1016/j.disc.2020.111881 Yan Cao , Guantao Chen , Suyun Jiang , Huiqing Liu , Fuliang Lu
Given a graph , denote by and the maximum degree and the chromatic index of , respectively. A simple graph is called edge--critical if , and for every proper subgraph of . We prove that every edge--critical graph of order with maximum degree at least is Hamiltonian.
中文翻译:
边色临界图的汉密尔顿性
给定图 ,以表示 和 最大度数和色度指数 , 分别。一个简单的图被称为边缘-如果, 和 对于每个适当的子图 的 。我们证明,每个优势-临界图 至少具有最高学位 是哈密尔顿。