1-factor covers of regular graphs

DOI10.1016/J.DAM.2010.12.003MaRDI QIDQ628309zbMATH OpenOpenAlexFDO

Authors 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

perfect matching1-factoroverfullexcessive factorization

Mathematics Subject Classification ID

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

Recommendations

• Vertex-regular 1-factorizations of the complete graph
• Some results of minimum sets of 1-factors covering a graph
• scientific article; zbMATH DE number 6843209
• scientific article; zbMATH DE number 2192197
• On 1-well-covered graphs
• scientific article; zbMATH DE number 927057
• scientific article; zbMATH DE number 4145942
• scientific article; zbMATH DE number 1491625
• On minimum sets of 1-factors covering a complete multipartite graph

Cites work

• scientific article; zbMATH DE number 5130724 (Why is no real title available?)
• A new lower bound on the number of perfect matchings in cubic graphs
• Bottleneck extrema
• Matching theory
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Overfull sets of one-factors

Cited in

(11)

• On excessive index of certain networks
• Characterizing minimally 1-factorable r-regular bipartite graphs
• Some results on path-factor critical avoidable graphs
• The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
• On the excessive \([m]\)-index of a tree
• Unions of 1-factors in \(r\)-graphs and overfull graphs
• scientific article; zbMATH DE number 2192197 (Why is no real title available?)
• Covering numbers of regular multigraphs
• On minimum sets of 1-factors covering a complete multipartite graph
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628309)