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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5152248
Language Label Description Also known as
default for all languages
No label defined
    English
    A degree sum condition for longest cycles in 3-connected graphs
    scientific article; zbMATH DE number 5152248

      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