On edge-disjoint pairs of matchings

DOI10.1016/j.disc.2007.09.061zbMath1204.05080arXiv0708.1903OpenAlexW2065355983MaRDI QIDQ998470

V. L. Musoyan, A. V. Tserunyan, Vahan V. Mkrtchyan

Publication date: 28 January 2009

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

Full work available at URL: https://arxiv.org/abs/0708.1903

zbMATH Keywords

matchingmaximum matchingpair of edge-disjoint matchings

Mathematics Subject Classification ID

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

Related Items (9)

Influence of smooth temperature variation on hotspot ignition ⋮ Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Disjoint stable matchings in linear time ⋮ Pairs of disjoint matchings and related classes of graphs ⋮ On 2-factors with a bounded number of odd components ⋮ On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs ⋮ Homogeneous charge compression ignition (HCCI) engines: a review ⋮ On disjoint matchings in cubic graphs ⋮ Characterization of a class of graphs related to pairs of disjoint matchings

Cites Work

• Unnamed Item
• Characterization of a class of graphs related to pairs of disjoint matchings
• Matching theory
• Parallel concepts in graph theory
• A note on minimal matching covered graphs
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• On the Core of a Graph^†

This page was built for publication: On edge-disjoint pairs of matchings