Rooted prism-minors and disjoint cycles containing a specified edge (Q6162146): Difference between revisions

Summary: \textit{G. A. Dirac} [Can. Math. Bull. 6, 183--210 (1963; Zbl 0138.19203)] and \textit{L. Lovász} [Mat. Lapok 16, 289--299 (1965; Zbl 0151.33403)] independently characterized the \(3\)-connected graphs with no pair of vertex-disjoint cycles. Equivalently, they characterized all \(3\)-connected graphs with no prism-minors. In this paper, we completely characterize the \(3\)-connected graphs with no edge that is contained in the union of a pair of vertex-disjoint cycles. As applications, we answer the analogous questions for edge-disjoint cycles and for \(4\)-connected graphs and we completely characterize the \(3\)-connected graphs with no prism-minor using a specified edge.