Overfull conjecture for graphs with high minimum degree

DOI10.1002/JGT.20013MaRDI QIDQ3159391zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. Plantholt

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

zbMATH Keywords

1-factorchromatic indexoverful conjecture

Mathematics Subject Classification ID

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

• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• Edge coloring graphs with large minimum degree
• Two conjectures on edge-colouring
• The overfullness of graphs with small minimum degree and large maximum degree
• Chromatic index of dense quasirandom graphs

Cites work

• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte

Cited in

(12)

• Two conjectures on edge-colouring
• How to find overfull subgraphs in graphs with large maximum degree. II
• 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
• Regular Multigraphs of High Degree are 1-Factorizable
• The chromatic index of complete multipartite graphs
• scientific article; zbMATH DE number 1998290 (Why is no real title available?)
• The overfullness of graphs with small minimum degree and large maximum degree
• Overlaying a hypergraph with a graph with bounded maximum degree
• Edge coloring graphs with large minimum degree
• The overfull conjecture on graphs of odd order and large minimum degree

This page was built for publication: Overfull conjecture for graphs with high minimum degree

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