How many matchings cover the nodes of a graph?

DOI10.1007/s10107-022-01804-9arXiv1811.07327OpenAlexW2900535373MaRDI QIDQ6201927

András Sebő, Zoltán Király, Gautier Stauffer, Dehia Ait-Ferhat

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

matchingpackingcovering factors

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On matching cover of graphs
• A simple existence criterion for \((g<f)\)-factors
• Packings by cliques and by finite families of graphs
• Matching theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Packings by Complete Bipartite Graphs
• The NP-Completeness of Edge-Coloring
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• Maximum matching and a polyhedron with 0,1-vertices
• The Factorization of Linear Graphs
• The 1-Factors of Oriented Graphs
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: How many matchings cover the nodes of a graph?