Totally equimatchable graphs

DOI10.1016/S0012-365X(96)00062-3zbMath0873.05070MaRDI QIDQ1356717

Jerzy Topp, Preben Dahl Vestergaard

Publication date: 26 October 1997

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

zbMATH Keywords

bipartite graphscomplete graphstotal matchingtotally equimatchable graphswindmills

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

A short update on equipackable graphs ⋮ On the algorithmic complexity of twelve covering and independence parameters of graphs

Cites Work

• Unnamed Item
• Matching theory
• Parallel concepts in graph theory
• Total matchings and total coverings of graphs
• Randomly matchable graphs
• WELL-COVERED GRAPHS: A SURVEY
• Equimatchable factor‐critical graphs
• Some covering concepts in graphs

This page was built for publication: Totally equimatchable graphs