Cycles through three vertices in 2-connected graphs

DOI10.1007/BF01787632zbMath0763.05057OpenAlexW2093610297MaRDI QIDQ1180435

Cun-Quan Zhang, Stephen C. Locke

Publication date: 27 June 1992

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

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

zbMATH Keywords

cycleHamiltonian graphminimum degree2-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Cycles and paths through specified vertices in k-connected graphs ⋮ Long cycles passing through a linear forest ⋮ Cycles through 4 vertices in 3-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of Dirac's theorem
• Cycles and paths through specified vertices in k-connected graphs
• Long cycles through specified vertices in a graph
• Applications of Menger's graph theorem
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Some Theorems on Abstract Graphs

This page was built for publication: Cycles through three vertices in 2-connected graphs