Integer and Fractional Matchings

DOI10.1016/S0304-0208(08)73453-4MaRDI QIDQ3937449zbMATH OpenOpenAlexFDO

Authors E. Balas

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73453-4

zbMATH Keywords

fractional matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Integer programming (90C10)

Cited in

(20)

• An extension of matching theory
• Fractional matchings and the Edmonds-Gallai theorem
• On matroids induced by packing subgraphs
• Testing the necklace condition for shortest tours and optimal factors in the plane
• A rounding algorithm for integer programs
• Fractional matroid matchings
• Relations between global forcing number and maximum anti-forcing number of a graph
• Tractability of König edge deletion problems
• Additive stabilizers for unstable graphs
• Stabilizing weighted graphs
• Packing $k$-Matchings and $k$-Critical Graphs
• Graph stabilization: a survey
• Stabilizing weighted graphs
• Birkhoff-von Neumann graphs that are PM-compact
• Some Results on Fractional Graph Theory
• On the fractional matching extendability of Cayley graphs of abelian groups
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Spectral aspects of symmetric matrix signings
• Graph factors and factorization: 1985--2003: a survey
• Finding small stabilizers for unstable graphs

This page was built for publication: Integer and Fractional Matchings

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