On the multigraph overfull conjecture

DOI10.1002/JGT.23221MaRDI QIDQ6994440zbMATH OpenFDO

Authors Michael J. Plantholt, Songling Shan

Publication date 23 April 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.23221

zbMATH Keywords

chromatic indexfractional chromatic indexoverfull conjectureoverfull graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• All regular multigraphs of even order and high degree are 1-factorable
• An asymptotic version of the multigraph 1-factorization conjecture
• Edge coloring graphs with large minimum degree
• Edge coloring regular graphs of high degree
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• scientific article; zbMATH DE number 4132188 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• Lectures on an introduction to Grothendieck's theory of the fundamental group
• On Hamilton's ideals
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the fg-coloring of graphs
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Regular Graphs of High Degree are 1-Factorizable
• Regular Multigraphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• The chromatic index of multigraphs of order at most 10
• The NP-Completeness of Edge-Coloring
• The overfull conjecture on graphs of odd order and large minimum degree

This page was built for publication: On the multigraph overfull conjecture

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