\(D_ \lambda\)-cycles in 3-cyclable graphs

DOI10.1007/BF01787817zbMath0854.05069OpenAlexW2033155237MaRDI QIDQ1906861

Henk Jan Veldman

Publication date: 13 January 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787817

zbMATH Keywords

cycleindependence numbertriangle-free graphclaw-freehamiltonicityclaw-center

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Some degree bounds for the circumference of graphs

Cites Work

• Existence of Dlambda-cycles and Dlambda-paths
• Longest cycles in triangle-free graphs
• Hamiltonicity in 2-connected graphs with claws
• Longest paths and cycles in K1,3-free graphs
• Toughness and hamiltonicity in almost claw-free graphs
• Cycles and Connectivity in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(D_ \lambda\)-cycles in 3-cyclable graphs