Overfull conjecture for graphs with high minimum degree
From MaRDI portal
Publication:3159391
DOI10.1002/jgt.20013zbMath1055.05063OpenAlexW4250807908WikidataQ123290720 ScholiaQ123290720MaRDI QIDQ3159391
Publication date: 16 February 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20013
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ Chromatic index of dense quasirandom graphs ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ Edge coloring graphs with large minimum degree ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree
Cites Work
This page was built for publication: Overfull conjecture for graphs with high minimum degree