Towards the overfull conjecture

DOI10.1002/JGT.70030MaRDI QIDQ7285746zbMATH OpenFDO

Authors Songling Shan

Publication date 22 June 2026

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

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

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)

Cites work

• 1-factorizing regular graphs of high degree - an improved bound
• A remark on the existence of finite graphs
• An asymptotic version of the multigraph 1-factorization conjecture
• Chromatic index of dense quasirandom graphs
• Edge coloring graphs with large minimum degree
• Edge coloring regular graphs of high degree
• Graph edge coloring. Vizing's theorem and Goldberg's conjecture
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Hamiltonicity of edge-chromatic critical graphs
• How to find overfull subgraphs in graphs with large maximum degree. II
• scientific article; zbMATH DE number 4132188 (Why is no real title available?)
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3266380 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• Independent sets and 2‐factors in edge‐chromatic‐critical graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Proof of the 1-factorization and Hamilton Decomposition Conjectures
• Regular Graphs of High Degree are 1-Factorizable
• The average degree of edge chromatic critical graphs with maximum degree seven
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
• The chromatic index of nearly bipartite multigraphs
• The NP-Completeness of Edge-Coloring
• The overfull conjecture on graphs of odd order and large minimum degree
• The overfullness of graphs with small minimum degree and large maximum degree
• The Solution of a Timetabling Problem
• Vertex-splitting and chromatic index critical graphs
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: Towards the overfull conjecture

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