Characterization of a class of graphs related to pairs of disjoint matchings

DOI10.1016/j.disc.2008.01.004zbMath1170.05049arXiv0712.1014OpenAlexW2022054586MaRDI QIDQ1011703

Anush Tserunyan

Publication date: 9 April 2009

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

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

zbMATH Keywords

matchingmaximum matchingpair of disjoint matchings

Mathematics Subject Classification ID

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

Related Items (5)

Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Pairs of disjoint matchings and related classes of graphs ⋮ 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

Cites Work

• Unnamed Item
• On complexity of special maximum matchings constructing
• On edge-disjoint pairs of 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
• The NP-Completeness of Edge-Coloring
• On the Core of a Graph^†

This page was built for publication: Characterization of a class of graphs related to pairs of disjoint matchings