Cycles and paths through specified vertices in k-connected graphs

DOI10.1016/0095-8956(91)90086-YzbMath0666.05044MaRDI QIDQ1116957

Stephen C. Locke, R. Glas, Yoshimi Egawa

Publication date: 1991

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

zbMATH Keywords

pathscycleminimum degreelongest cycleDirac's theorem

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (18)

Claw-free graphs and 2-factors that separate independent vertices ⋮ Updating the hamiltonian problem—A survey ⋮ $n$-Arc connected graphs ⋮ Heavy fans, cycles and paths in weighted graphs of large connectivity ⋮ On the Hadwiger's conjecture for graph products ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ Long cycles through specified vertices ⋮ Long cycles passing through a linear forest ⋮ Disjoint long cycles in a graph ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Cycles through three vertices in 2-connected graphs ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Cycles through 4 vertices in 3-connected graphs ⋮ Long paths and cycles passing through specified vertices under the average degree condition ⋮ A look at cycles containing specified elements of a graph ⋮ Weighted degrees and heavy cycles in weighted graphs ⋮ Long cycles through a linear forest ⋮ Existence of two disjoint long cycles in graphs

Cites Work

• A generalization of Dirac's theorem
• Relative lengths of paths and cycles in k-connected graphs
• Cycles through three vertices in 2-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 and paths through specified vertices in k-connected graphs