A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188)

From MaRDI portal
Revision as of 14:40, 11 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A degree sum condition with connectivity for relative length of longest paths and cycles
scientific article

    Statements

    A degree sum condition with connectivity for relative length of longest paths and cycles (English)
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    degree sum
    0 references
    longest cycle
    0 references
    longest path
    0 references
    dominating cycle
    0 references