A note on minimal matching covered graphs

DOI10.1016/j.disc.2005.12.006zbMath1086.05062OpenAlexW2074250906MaRDI QIDQ2368933

Vahan V. Mkrtchyan

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.006

zbMATH Keywords

Perfect matchingMaximum matching

Mathematics Subject Classification ID

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

Related Items (5)

Graphs with each edge in at most one maximum matching ⋮ On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs ⋮ On disjoint matchings in cubic graphs ⋮ On edge-disjoint pairs of matchings ⋮ Characterization of a class of graphs related to pairs of disjoint matchings

Cites Work

• Unnamed Item
• Matching theory
• Parallel concepts in graph theory
• Coverings of Bipartite Graphs
• On the Core of a Graph^†

This page was built for publication: A note on minimal matching covered graphs