1-factor covers of regular graphs

DOI10.1016/j.dam.2010.12.003zbMath1209.05176OpenAlexW1987960364MaRDI QIDQ628309

Juan-Miguel Gracia

Publication date: 10 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.003

zbMATH Keywords

1-factorperfect matchingoverfullexcessive factorization

Mathematics Subject Classification ID

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

Related Items (5)

On excessive index of certain networks ⋮ Excessive index for mesh derived networks ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ On the excessive \([m\)-index of a tree] ⋮ Some results on path-factor critical avoidable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Bottleneck extrema

This page was built for publication: 1-factor covers of regular graphs