The paper shows that three theorems due to \textit{J. Petersen} [Acta Math. 15, 193-220 (1891; JFM 23.0115.03)], \textit{Ø. Ore} [Trans. Am. Math. Soc. 84, 109-136 (1957; Zbl 0077.170)], \textit{F. Bäbler} [Comment. Math. Helv. 10, 275-287 (1938; Zbl 0019.23603)] and \textit{T. Gallai} [Acta Math. Acad. Sci. Hung. 1, 133-152 (1950; Zbl 0040.259)] on regular graphs can be derived from Tutte's f-factor theorem. As a result, it provides slight generalizations of existing results.
Recommendations
Cites work
Cited in
(17)- Factors of regular graphs
- A note on f-factors in directed and undirected multigraphs
- More sufficient conditions for a graph to have factors
- Regular factors of simple regular graphs and factor-spectra
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Equitable factorizations of edge-connected graphs
- Regular factors in regular graphs
- Cut-edges and regular factors in regular graphs of odd degree
- A proof of Petersen's theorem
- scientific article; zbMATH DE number 5130724 (Why is no real title available?)
- Factors in a class of regular digraphs
- Regular factors in K1,n free graphs
- scientific article; zbMATH DE number 33169 (Why is no real title available?)
- Regular Graphs of High Degree are 1-Factorizable
- scientific article; zbMATH DE number 3893248 (Why is no real title available?)
- Sufficient conditions for a graph to have factors
- Graph factors and factorization: 1985--2003: a survey
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)