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

DOI10.1016/0095-8956(78)90009-6zbMATH Open0409.05027OpenAlexW2089339578MaRDI QIDQ1258751FDOQ1258751

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• 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
• Title not available (Why is that?)
• Solving Matching Problems Efficiently in Bipartite Graphs

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

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