1-factor covers of regular graphs
From MaRDI portal
Publication:628309
DOI10.1016/J.DAM.2010.12.003zbMATH Open1209.05176OpenAlexW1987960364MaRDI QIDQ628309FDOQ628309
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
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
- Publication:4892330
- scientific article
- scientific article; zbMATH DE number 1491625
- On minimum sets of 1-factors covering a complete multipartite graph
Cites Work
Cited In (10)
- 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
- Title not available (Why is that?)
- 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)
