F-factors of graphs: A generalized matching problem

DOI10.1016/0020-0190(79)90026-7MaRDI QIDQ1135864zbMATH OpenOpenAlexFDO

Authors 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

perfect matchingsbipartite graphsmagic squaresF-factor

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3632554 (Why is no real title available?)
• scientific article; zbMATH DE number 3020563 (Why is no real title available?)
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Bestimmung eines maximalen Matching in beliebigen Graphen

Cited in

(7)

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

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

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