Long cycles through specified vertices in a graph

DOI10.1016/0095-8956(89)90021-XzbMath0686.05031OpenAlexW2046473600MaRDI QIDQ1262323

Akira Saito

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90021-x

zbMATH Keywords

Hamiltonian circuitk-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

Large degree vertices in longest cycles of graphs. I ⋮ Cycles and paths through specified vertices in k-connected graphs ⋮ Cycles through three vertices in 2-connected graphs ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Large degree vertices in longest cycles of graphs II

Cites Work

• A generalization of Dirac's theorem
• Applications of Menger's graph theorem
• A Theorem on Planar Graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Long cycles through specified vertices in a graph