Characterization of saturated graphs related to pairs of disjoint matchings

DOI10.1215/00192082-9719963zbMath1487.05211arXiv2011.11187OpenAlexW3106856487MaRDI QIDQ2135642

Jenna Zomback, Anush Tserunyan, Sam Qunell, Zhengda Mo

Publication date: 9 May 2022

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph decompositions into even cyclesgraph decompositions into pathsmaximum 2-edge colorable subgraph problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the maximum 2- and 3-edge-colorable subgraph problems
• On disjoint matchings in cubic graphs
• On edge-disjoint pairs of matchings
• Characterization of a class of graphs related to pairs of disjoint matchings
• Matching theory
• On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
• Parameterized complexity of \textsc{maximum edge colorable subgraph}
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• 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
• The Factorization of Linear Graphs

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