The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree

DOI10.1137/21M1432776zbMath1503.05022arXiv2105.05333OpenAlexW4296917130WikidataQ114074009 ScholiaQ114074009MaRDI QIDQ5866456

Yan Cao, Guantao Chen, Guangming Jing, Songling Shan

Publication date: 21 September 2022

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

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

zbMATH Keywords

overfull conjectureoverfull graphKierstead pathmultifan

Mathematics Subject Classification ID

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

Cites Work

• An improvement to the Hilton-Zhao vertex-splitting conjecture
• On the average degree of edge chromatic critical graphs. II.
• Overfull conjecture for graphs with high minimum degree
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree