Integer and Fractional Matchings
From MaRDI portal
Publication:3937449
DOI10.1016/S0304-0208(08)73453-4zbMath0481.05055OpenAlexW1538436260MaRDI QIDQ3937449
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
Extremal problems in graph theory (05C35) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A rounding algorithm for integer programs, Fractional matchings and the Edmonds-Gallai theorem, Some Results on Fractional Graph Theory, On matroids induced by packing subgraphs, Graph factors and factorization: 1985--2003: a survey, Additive stabilizers for unstable graphs, Finding small stabilizers for unstable graphs, Unnamed Item, Packing $k$-Matchings and $k$-Critical Graphs, Birkhoff--von Neumann Graphs that are PM-Compact, Graph Stabilization: A Survey, Testing the necklace condition for shortest tours and optimal factors in the plane, Fractional matroid matchings, Stabilizing Weighted Graphs, Relations between global forcing number and maximum anti-forcing number of a graph, Spectral aspects of symmetric matrix signings, Tractability of König edge deletion problems, An extension of matching theory
