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

DOI10.1016/J.DISC.2022.112880MaRDI QIDQ2138974zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Overfull conjecture for graphs with high minimum degree
• Edge coloring graphs with large minimum degree
• The overfullness of graphs with small minimum degree and large maximum degree
• Two conjectures on edge-colouring
• Chromatic index of dense quasirandom graphs

Cites work

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

Cited in

(11)

• Chromatic index of dense quasirandom graphs
• On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges.
• Overfull conjecture for graphs with high minimum degree
• Regular Multigraphs of High Degree are 1-Factorizable
• The chromatic index of graphs of even order with many edges
• The overfullness of graphs with small minimum degree and large maximum degree
• Edge coloring graphs with large minimum degree
• The overfull conjecture on graphs of odd order and large minimum degree
• On the multigraph overfull conjecture
• Towards the overfull conjecture
• The chromatic index of a graph whose core is a cycle of order at most 13

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)