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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 11:17, 5 March 2024

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