Vizing's 2-factor conjecture involving toughness and maximum degree conditions

zbMath1412.05045arXiv1709.02241MaRDI QIDQ2415079

Jinko Kanno, Songling Shan

Publication date: 20 May 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

Forbidden subgraphs and 2‐factors in 3/2‐tough graphs ⋮ On the chromatic edge stability index of graphs ⋮ Existence of 2-factors in tough graphs without forbidden subgraphs ⋮ Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in critical graphs with large maximum degree
• Average degrees of edge-chromatic critical graphs
• A note on Vizing's independence number conjecture of edge chromatic critical graphs
• The independence number of an edge-chromatic critical graph
• A new upper bound for the independence number of edge chromatic critical graphs
• The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
• Toughness and the existence ofk-factors
• The NP-Completeness of Edge-Coloring
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Bounds for the Independence Number of 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 Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Vizing's 2-factor conjecture involving toughness and maximum degree conditions