Hamiltonicity of edge-chromatic critical graphs

被引：1

作者：

Cao, Yan ^{[1
]}

Chen, Guantao ^{[1
]}

Jiang, Suyun ^{[2
]}

Liu, Huiqing ^{[3
]}

Lu, Fuliang ^{[4
]}

机构：

[1] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 USA

[2] Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Hubei, Peoples R China

[3] Hubei Univ, Fac Math & Stat, Hubei Key Lab Appl Math, Wuhan 430062, Hubei, Peoples R China

[4] Minnan Normal Univ, Sch Math & Stat, Zhangzhou 363000, Peoples R China

来源：

DISCRETE MATHEMATICS | 2020年 / 343卷 / 07期

关键词：

Edge-k-coloring; Edge-critical graphs; Hamiltonicity; CONJECTURE;

D O I：

10.1016/j.disc.2020.111881

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given a graph G, denote by Delta(G) and chi'(G) the maximum degree and the chromatic index of G, respectively. A simple graph G is called edge-Delta-critical if Delta(G) = Delta, chi'(G) = Delta + 1 and chi'(H) <= Delta for every proper subgraph H of G. We prove that every edge-A-critical graph of order n with maximum degree at least 2n/3+ 12 is Hamiltonian. (C) 2020 Elsevier B.V. All rights reserved.

引用

页数：16

共 50 条

[21] The Independence Number of an Edge-Chromatic Critical Graph
Woodall, Douglas R.
[J]. JOURNAL OF GRAPH THEORY, 2011, 66 (02) : 98 - 103
[22] Edge-chromatic sum of trees and bounded cyclicity graphs
Giaro, K
Kubale, M
[J]. INFORMATION PROCESSING LETTERS, 2000, 75 (1-2) : 65 - 69
[23] Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Gurvich, Vladimir
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (14) : 3069 - 3085
[24] The average degree of a subcubic edge-chromatic critical graph
Woodall, Douglas R.
[J]. JOURNAL OF GRAPH THEORY, 2019, 91 (02) : 103 - 121
[25] The average degree of an edge-chromatic critical graph II
Woodall, Douglas R.
[J]. JOURNAL OF GRAPH THEORY, 2007, 56 (03) : 194 - 218
[26] THE EDGE-CHROMATIC CLASS OF REGULAR GRAPHS OF DEGREE 4 AND THEIR COMPLEMENTS
CHETWYND, AG
HILTON, AJW
[J]. DISCRETE APPLIED MATHEMATICS, 1987, 16 (02) : 125 - 134
[27] Chromatic Number and Hamiltonicity of Graphs
Li, Rao
[J]. Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 113 : 253 - 257
[28] On the size of edge chromatic critical graphs
Sanders, DP
Zhao, Y
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 86 (02) : 408 - 412
[29] Upper bounds on the D(β)-vertex-distinguishing edge-chromatic numbers of graphs
Tian Jing-jing
Liu Xin-sheng
Zhang Zhong-fu
Deng Fang-an
[J]. COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 453 - +
[30] EDGE-CHROMATIC SCHEDULING WITH SIMULTANEITY CONSTRAINTS
DEWERRA, D
MAHADEV, NVR
PELED, UN
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (04) : 631 - 641

← 1 2 3 4 5 →