Strong binding numbers and factors

DOI10.1016/J.DISC.2026.115224MaRDI QIDQ7285304zbMATH OpenFDO

Authors Guantao Chen, Mikhail Lavrov, Yuying Ma, Jennifer Vandenbussche, Hein van der Holst

Publication date 19 June 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115224

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A Short Proof of the Factor Theorem for Finite Graphs
• An optimal binding number condition for bipancyclism
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Disjoint matchings of graphs
• Existence of 2-factors in tough graphs without forbidden subgraphs
• scientific article; zbMATH DE number 1780075 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Perfect matchings of a graph
• The binding number of a graph and its Anderson number
• The double Hall property and cycle covers in bipartite graphs
• The theory of regular graphs
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions

This page was built for publication: Strong binding numbers and factors

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