Matchings in graphs. II

DOI10.1016/0012-365X(75)90006-0zbMath0299.05115OpenAlexW2076622304MaRDI QIDQ1214950

Paul J. McCarthy

Publication date: 1975

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

Full work available at URL: https://doi.org/10.1016/0012-365x(75)90006-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Graph factors and factorization: 1985--2003: a survey, Full transversal matroids, strict gammoids, and the matroid components problem, Strict matching matroids and matroid algorithms, Matchings in infinite graphs, The Edmonds-Gallai decomposition for matchings in locally finite graphs

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Perfect matchings of a graph
• TWO THEOREMS IN GRAPH THEORY
• Transversals and matroid partition
• Subgraphs with prescribed valencies
• Matchings in graphs
• The Factorization of Linear Graphs
• A Short Proof of the Factor Theorem for Finite Graphs