A constructive characterization of trees with at least k disjoint maximum matchings

DOI10.1016/0095-8956(78)90009-6zbMath0409.05027OpenAlexW2089339578MaRDI QIDQ1258751

Peter J. Slater

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90009-6

zbMATH Keywords

TreesEdge-Disjoint Maximal Matchings

Mathematics Subject Classification ID

Trees (05C05)

Related Items (4)

Solving Matching Problems Efficiently in Bipartite Graphs ⋮ Minimum \(d\)-blockers and \(d\)-transversals in graphs ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constructive characterization of trees with at least k disjoint maximum matchings