Pairs of disjoint matchings and related classes of graphs

DOI10.2140/involve.2023.16.249zbMath1519.05202arXiv2005.00671OpenAlexW3022937793MaRDI QIDQ6117063

Joe Rogge, Kieran Kaempen, Chao Song, Sam Qunell, Jenna Zomback, Anush Tserunyan, Huizheng Guo, Zhengda Mo

Publication date: 19 July 2023

Published in: Involve (Search for Journal in Brave)

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

zbMATH Keywords

edge coloringgraph matchingmaximum 2-edge colorable subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On disjoint matchings in cubic graphs
• On edge-disjoint pairs of matchings
• Characterization of a class of graphs related to pairs of disjoint matchings
• On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
• Parameterized complexity of \textsc{maximum edge colorable subgraph}
• On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
• The NP-Completeness of Edge-Coloring
• Paths, Trees, and Flowers

This page was built for publication: Pairs of disjoint matchings and related classes of graphs