Cycles through \(k+2\) vertices in \(k\)-connected graphs

DOI10.1016/0012-365X(84)90040-2zbMath0537.05035MaRDI QIDQ792340

N. Tsikopoulos

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

vertex-connectivitycocyclic

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (2)

The existence of \(k\)-factors in squares of graphs ⋮ A look at cycles containing specified elements of a graph

Cites Work

• On cycles through prescribed vertices in weakly separable graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Cycles and Connectivity in Graphs

This page was built for publication: Cycles through \(k+2\) vertices in \(k\)-connected graphs