Covering cubic graphs with matchings of large size

zbMath1277.05135arXiv1210.3930MaRDI QIDQ2848743

Simona Bonvicini, Giuseppe Mazzuoccolo

Publication date: 26 September 2013

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

zbMATH Keywords

\([m\)-matching]excessive \([m\)-index of a graph \(G\)]

Mathematics Subject Classification ID

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

Related Items (3)

Covering a cubic graph with perfect matchings ⋮ On the excessive \([m\)-index of a tree] ⋮ Excessive \([l, m\)-factorizations]

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