On cycles through prescribed vertices in weakly separable graphs

DOI10.1016/0012-365X(83)90251-0zbMATH Open0556.05042MaRDI QIDQ761466

Alexander Kelmans, Michael V. Lomonosov

Publication date: 1983

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

zbMATH Keywords

k-connected graphspolytopal graphsT-cycleT-separator

Mathematics Subject Classification ID

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

Cites Work

• On cycles through prescribed vertices in weakly separable graphs
• On the graph structure of convex polyhedra in \(n\)-space
• Matroid matching and some applications
• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• Über die Maximalzahl kantendisjunkter A-Wege
• Circuits and paths through specified nodes
• 4‐chrome Graphen und vollständige 4‐Graphen
• A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
• Cycles and Connectivity in Graphs

Related Items (4)

Unnamed Item ⋮ On cycles through prescribed vertices in weakly separable graphs ⋮ A look at cycles containing specified elements of a graph ⋮ Cycles through \(k+2\) vertices in \(k\)-connected graphs

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Cycles in graphs with prescribed stability number and connectivity 👍 👎
• On short cycles through prescribed vertices of a graph 👍 👎
• On some cycles in Wenger graphs 👍 👎
• Cycles in graphs and related problems 👍 👎
• Nonseparable graphs with a given number of cycles 👍 👎
• Vertex‐disjoint cycles containing prescribed vertices 👍 👎
• On short cycles through prescribed vertices of a polyhedral graph 👍 👎

This page was built for publication: On cycles through prescribed vertices in weakly separable graphs