A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture
From MaRDI portal
Publication:5325954
DOI10.1002/jgt.21689zbMath1269.05038OpenAlexW1549060686WikidataQ123181924 ScholiaQ123181924MaRDI QIDQ5325954
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21689
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (6)
Hamiltonian cycles in critical graphs with large maximum degree ⋮ Even factors in edge-chromatic-critical graphs with a small number of divalent vertices ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chromatic index critical graphs of order 9
- On critical graphs with chromatic index 4
- On small graphs critical with respect to edge colourings
- How to find overfull subgraphs in graphs with large maximum degree
- Planar graphs of maximum degree seven are Class I
- A note on Vizing's independence number conjecture of edge chromatic critical graphs
- Large cycles in graphs
- Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5
- The size of edge chromatic critical graphs with maximum degree 6
- 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
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture
