The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503)

From MaRDI portal
Revision as of 18:34, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The upper bound of the number of cycles in a 2-factor of a line graph
scientific article

    Statements

    The upper bound of the number of cycles in a 2-factor of a line graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2007
    0 references
    line graph
    0 references
    2-factor
    0 references
    number of components
    0 references

    Identifiers