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

DOI10.1016/J.DISC.2022.112880zbMATH Open1489.05057OpenAlexW4221094607WikidataQ114190530 ScholiaQ114190530MaRDI QIDQ2138974FDOQ2138974

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

1-factorizationchromatic indexoverfull conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

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

Cited In (4)

• On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.
• The chromatic index of graphs of even order with many edges
• The chromatic index of a graph whose core is a cycle of order at most 13
• Edge coloring graphs with large minimum degree

This page was built for publication: The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138974)