A sharp lower bound for the circumference of 1‐tough graphs with large degree sums (Q4852400)

From MaRDI portal
Revision as of 02:36, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 811249
Language Label Description Also known as
English
A sharp lower bound for the circumference of 1‐tough graphs with large degree sums
scientific article; zbMATH DE number 811249

    Statements

    A sharp lower bound for the circumference of 1‐tough graphs with large degree sums (English)
    0 references
    0 references
    31 October 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bound
    0 references
    dominating cycle
    0 references
    longest cycle
    0 references
    1-tough graph
    0 references
    degree sum
    0 references
    independent set
    0 references
    hamiltonian cycles
    0 references
    0 references