Cycles through k+2 vertices in k-connected graphs

DOI10.1016/0012-365X(84)90040-2MaRDI QIDQ792340zbMATH OpenFDO

Authors 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)

Recommendations

• Cycles and paths through specified vertices
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• A generalization of a theorem of Dirac
• A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
• Cycles passing throughk + 1 vertices ink-connected graphs

Cites work

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

Cited in

(7)

• Cycles through edges in cyclically \(k\)-connected cubic graphs
• Cycles passing throughk + 1 vertices ink-connected graphs
• The existence of \(k\)-factors in squares of graphs
• A look at cycles containing specified elements of a graph
• Euler cycles in the complete graph \(K_{2m+1}\)
• Cooperative properties and connected sum
• A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792340)