Fractional matchings and the Edmonds-Gallai theorem

DOI10.1016/0166-218X(87)90053-9zbMath0637.05019MaRDI QIDQ1098861

William R. Pulleyblank

Publication date: 1987

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

zbMATH Keywords

graph characterization; Edmonds-Gallai structure theorem; maximum fractional matchings

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Some Results on Fractional Graph Theory, On the computational complexity of upper fractional domination, Graph factors and factorization: 1985--2003: a survey, Characterizations of maximum fractional \((g,f)\)-factors of graphs, Minimum spectral radius of a weighted graph, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Fractional matroid matchings, Maximal irredundant functions

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item