A Short Proof of Ore’s f-Factor Theorem Using Flows

DOI10.1007/978-981-19-7014-6_12MaRDI QIDQ6193840zbMATH OpenFDO

Authors Sriraman Sridharan, Patrick Vilamajó

Publication date 13 February 2024

Published in Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-19-7014-6_12

Mathematics Subject Classification ID

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

Recommendations

• An algorithmic proof of Tutte's f-factor theorem
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• scientific article; zbMATH DE number 3853126
• Constructive proof of deficiency theorem of \((g,f)\)-factor
• scientific article; zbMATH DE number 653269

Cites work

• A theorem on flows in networks
• Graph theory with applications
• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• Spanning subgraphs with specified valencies

This page was built for publication: A Short Proof of Ore’s f-Factor Theorem Using Flows

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