A degree sum condition for longest cycles in 3-connected graphs (Q3437003)

From MaRDI portal
Revision as of 02:26, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A degree sum condition for longest cycles in 3-connected graphs
scientific article

    Statements

    A degree sum condition for longest cycles in 3-connected graphs (English)
    0 references
    0 references
    11 May 2007
    0 references
    degree sum
    0 references
    connectivity
    0 references
    longest circle
    0 references
    circumference
    0 references

    Identifiers