Matchings in graphs. II

DOI10.1016/0012-365X(75)90006-0MaRDI QIDQ1214950zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Short Proof of the Factor Theorem for Finite Graphs
• scientific article; zbMATH DE number 3340103 (Why is no real title available?)
• Matchings in graphs
• Parallel concepts in graph theory
• Perfect matchings of a graph
• Subgraphs with prescribed valencies
• The Factorization of Linear Graphs
• Transversals and matroid partition
• TWO THEOREMS IN GRAPH THEORY

Cited in

(5)

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

This page was built for publication: Matchings in graphs. II

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