Hamiltonian cycles in critical graphs with large maximum degree

DOI10.1007/s00373-016-1698-7zbMath1351.05085OpenAlexW2336476177MaRDI QIDQ343761

Rong Luo, Yue Zhao, Zheng-Ke Miao

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1698-7

zbMATH Keywords

Hamiltonian cyclescritical graphsedge colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Hamiltonicity of edge-chromatic critical graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Reducing Vizing's 2-factor conjecture to Meredith extension of critical graphs ⋮ Graph edge coloring: a survey ⋮ Upper bounds on the maximum degree of class two graphs on surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic index critical graphs of order 9
• A method in graph theory
• On small graphs critical with respect to edge colourings
• Chromatic-index-critical graphs of orders 11 and 12
• 3- and 4-critical graphs of small even order
• Planar graphs of maximum degree seven are Class I
• On Hamilton's ideals
• Large cycles in graphs
• Chromatic-index-critical graphs of orders 13 and 14
• Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
• Some remarks on a paper by Vizing on critical graphs
• ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture
• Some Theorems on Abstract Graphs

This page was built for publication: Hamiltonian cycles in critical graphs with large maximum degree