No label defined (Q5287814)

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 238370
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 238370

      Statements

      0 references
      19 September 1993
      0 references
      longest path
      0 references
      longest cycle
      0 references
      claw-free graphs
      0 references
      Given are two theorems and the attendant lemmas on the minimum length of a longest cycle \(C\) for 3-connected claw-free graphs: (1) \(| V(C)|\geq 4\delta+ 5\) if, for some such \(C\), \(G\backslash C\) contains no Hamiltonian-connected component; (2) \(| V(C)|\geq 4k+ 5\) if \(G\) is \(k\)-regular and if for every such \(C\) all components of \(G\backslash C\) are Hamiltonian-connected.
      0 references

      Identifiers