The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)

DOI10.1016/j.disc.2022.112880zbMath1489.05057OpenAlexW4221094607WikidataQ114190530 ScholiaQ114190530MaRDI QIDQ2138974

Michael J. Plantholt

Publication date: 17 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112880

zbMATH Keywords

chromatic index1-factorizationoverfull conjecture

Mathematics Subject Classification ID

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) Vertex degrees (05C07)

Related Items

Edge coloring graphs with large minimum degree

Cites Work

• Unnamed Item
• The chromatic index of graphs with large maximum degree
• Recent progress on edge-colouring graphs
• 1-factorizing regular graphs of high degree - an improved bound
• How to find overfull subgraphs in graphs with large maximum degree
• The chromatic index of graphs of high maximum degree
• Edge coloring regular graphs of high degree
• On Hamilton's ideals
• Overfull conjecture for graphs with high minimum degree
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Regular Graphs of High Degree are 1-Factorizable
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Some Theorems on Abstract Graphs