When m vertices in a k-connected graph cannot be walked round along a simple cycle
From MaRDI portal
Publication:1159693
DOI10.1016/0012-365X(82)90299-0zbMath0475.05053MaRDI QIDQ1159693
Alexander K. Kelmans, Michael V. Lomonosov
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On paths and cycles through specified vertices, Circuits through prescribed vertices in k‐connected k‐regular graphs, Local topological toughness and local factors, On short paths through prescribed vertices of a graph, Cycle traversability for claw-free graphs and polyhedral maps, Cycles through a prescribed vertex set in \(n\)-connected graphs., Cyclability of r-regular r-connected graphs, Cycles through ten vertices in 3-connected cubic graphs, A note on traversing specified vertices in graphs embedded with large representativity, On cycles through specified vertices, On cycles through prescribed vertices in weakly separable graphs, Hamiltonicity and minimum degree in 3-connected claw-free graphs
Cites Work
