Covering graphs with matchings of fixed size

DOI10.1016/j.disc.2008.09.031zbMath1243.05192OpenAlexW2021614430MaRDI QIDQ960925

Hung-Lin Fu, David Cariolaro

Publication date: 29 March 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.031

zbMATH Keywords

\([m\)-covering]excessive \([m\)-factorization]excessive \([m\)-index]

Mathematics Subject Classification ID

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

Related Items (4)

Excessive factorizations of bipartite multigraphs ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive \([l, m\)-factorizations]

Cites Work

• Matching theory
• On minimum sets of 1-factors covering a complete multipartite graph
• Paths, Trees, and Flowers
• The Solution of a Timetabling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering graphs with matchings of fixed size