Fractional matchings and the Edmonds-Gallai theorem
From MaRDI portal
Publication:1098861
DOI10.1016/0166-218X(87)90053-9zbMath0637.05019MaRDI QIDQ1098861
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Some Results on Fractional Graph Theory, Graph factors and factorization: 1985--2003: a survey, Maximal irredundant functions, Integer \(k\)-matchings of graphs, Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number, Finding small stabilizers for unstable graphs, An improvement on Łuczak's connected matchings method, Packing $k$-Matchings and $k$-Critical Graphs, Kidney exchange: further utilization of donors via listed exchange, Minimum spectral radius of a weighted graph, Characterizations of maximum fractional \((g,f)\)-factors of graphs, Efficient stabilization of cooperative matching games, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, Fractional matroid matchings, On the computational complexity of upper fractional domination, Spanning Trees with Few Branch Vertices, Spectral aspects of symmetric matrix signings, Tractability of König edge deletion problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- On certain classes of fractional matchings
- An extension of matching theory
- F-factors of graphs: A generalized matching problem
- Packing subgraphs in a graph
- Integer and Fractional Matchings
- Paths, Trees, and Flowers
- Transversals and matroid partition
- The Factors of Graphs
