On certain classes of fractional matchings

DOI10.1016/0166-218X(84)90023-4zbMath0545.90099MaRDI QIDQ798265

F. X. Steinparz, J. R. Mühlbacher, Gottfried Tinhofer

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

undirected graphf-matchingfractional matching problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Fractional matchings and the Edmonds-Gallai theorem, On matroids induced by packing subgraphs, Graph factors and factorization: 1985--2003: a survey, On generalized matching problems, Kidney exchange: further utilization of donors via listed exchange

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• F-factors of graphs: A generalized matching problem
• Vertex packings: Structural properties and algorithms
• Properties of vertex packing and independence system polyhedra
• The Factors of Graphs