Neighborhood conditions and edge-disjoint perfect matchings

DOI10.1016/0012-365X(91)90160-4zbMath0769.05073OpenAlexW1975723669MaRDI QIDQ1179275

Ronald J. Gould, Ralph J. Faudree, Linda Lesniak

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90160-4

zbMATH Keywords

edge-connectivityall pairs neighborhood conditionedge-disjoint perfect matchings

Mathematics Subject Classification ID

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

Related Items (1)

Disjoint stable matchings in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton cycles in regular 2-connected graphs
• Perfect matchings of a graph
• Extremal problems involving neighborhood unions
• On Representatives of Subsets
• On a problem of K. Zarankiewicz
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Neighborhood conditions and edge-disjoint perfect matchings