F-factors of graphs: A generalized matching problem

DOI10.1016/0020-0190(79)90026-7zbMath0426.05043OpenAlexW1493768132MaRDI QIDQ1135864

J. R. Mühlbacher

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90026-7

zbMATH Keywords

bipartite graphsperfect matchingsmagic squaresF-factor

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (7)

Fractional matchings and the Edmonds-Gallai theorem ⋮ Packings by Complete Bipartite Graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ On generalized matching problems ⋮ On caterpillar factors in graphs ⋮ An extension of matching theory ⋮ On certain classes of fractional matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bestimmung eines maximalen Matching in beliebigen Graphen
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

This page was built for publication: F-factors of graphs: A generalized matching problem