Hamiltonicity of edge-chromatic critical graphs

DOI10.1016/j.disc.2020.111881zbMath1440.05081arXiv1708.08921MaRDI QIDQ2182200

Fuliang Lu, Yan Cao, Huiqing Liu, Guantao Chen, Su-yun Jiang, Yue Zhao, Xiao Dong Chen

Publication date: 21 May 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08921

zbMATH Keywords

edge coloring; Hamiltonian cycles; Hamiltonicity; critical graphs; edge-\(k\)-coloring; edge-critical graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C45: Eulerian and Hamiltonian graphs

Related Items

Double Vizing fans in critical class two graphs, Graph edge coloring: a survey, Average degrees of edge-chromatic critical graphs, Hamiltonicity of edge-chromatic critical graphs, On the average degree of edge chromatic critical graphs. II., On the average degree of edge chromatic critical graphs, Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs, Upper bounds on the maximum degree of class two graphs on surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in critical graphs with large maximum degree
• On the chromatic index of multigraphs without large triangles
• A method in graph theory
• Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
• Hamiltonicity of edge-chromatic critical graphs
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• Some remarks on a paper by Vizing on critical graphs
• Degree sums for edges and cycle lengths in graphs
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Vizing's 2‐Factor Conjecture Involving Large Maximum Degree
• A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture
• The average degree of an edge‐chromatic critical graph II
• Every planar graph with maximum degree 7 is of class 1