Regular factors in nearly regular graphs (Q795844): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On factorisation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three short proofs in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Locally Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank

Revision as of 12:20, 14 June 2024

scientific article
Language Label Description Also known as
English
Regular factors in nearly regular graphs
scientific article

    Statements

    Regular factors in nearly regular graphs (English)
    0 references
    1984
    0 references
    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.
    0 references
    regular graph
    0 references
    f-factor
    0 references
    0 references
    0 references
    0 references

    Identifiers