Cycles through a prescribed vertex set in \(n\)-connected graphs.

DOI10.1016/j.jctb.2003.08.002zbMath1033.05063OpenAlexW2001534296MaRDI QIDQ1426102

Ken-ichi Kawarabayashi

Publication date: 14 March 2004

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.08.002

zbMATH Keywords

Cycles\(n\)-Connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (5)

An Improved Algorithm for Finding Cycles Through Elements ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ A look at cycles containing specified elements of a graph ⋮ One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture ⋮ Rooted topological minors on four vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• A nine point theorem for 3-connected graphs
• Circuits through specified edges
• Cycles through specified vertices of a graph
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• Cycles through ten vertices in 3-connected cubic graphs
• Applications of Menger's graph theorem
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Cyclability of r-regular r-connected graphs
• An 11-vertex theorem for 3-connected cubic graphs
• Cycles Through Prescribed and Forbidden Point Sets
• Cycles containing 12 vertices in 3-connected cubic graphs
• Cycles intersecting a prescribed vertex set
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• Cycles and Connectivity in Graphs

This page was built for publication: Cycles through a prescribed vertex set in \(n\)-connected graphs.