Algorithmic proofs of two relations between connectivity and the 1- factors of a graph

DOI10.1016/0012-365X(79)90058-XzbMath0463.05055MaRDI QIDQ1153100

Harold N. Gabow

Publication date: 1979

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

zbMATH Keywords

matched graphs

Mathematics Subject Classification ID

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

Cites Work

• Some improved bounds on the number of 1-factors of n-connected graphs
• Parallel concepts in graph theory
• On the 1-factors of n-connected graphs
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Paths, Trees, and Flowers
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs