Regular factors in nearly regular graphs
From MaRDI portal
Publication:795844
DOI10.1016/0012-365X(84)90030-XzbMATH Open0543.05051OpenAlexW2090850098MaRDI QIDQ795844FDOQ795844
Authors: Jean-Claude Bermond, Michel Las Vergnas
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90030-x
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cites Work
Cited In (17)
- Regular factors in regular graphs
- Title not available (Why is that?)
- More sufficient conditions for a graph to have factors
- Title not available (Why is that?)
- A proof of Petersen's theorem
- Cut-edges and regular factors in regular graphs of odd degree
- Regular factors of simple regular graphs and factor-spectra
- Equitable factorizations of edge-connected graphs
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Factors of regular graphs
- Factors in a class of regular digraphs
- Regular factors in K1,n free graphs
- Regular Graphs of High Degree are 1-Factorizable
- Graph factors and factorization: 1985--2003: a survey
- Sufficient conditions for a graph to have factors
- A note on f-factors in directed and undirected multigraphs
- Title not available (Why is that?)
This page was built for publication: Regular factors in nearly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795844)