Rooted Prism-Minors and Disjoint Cycles Containing a Specified Edge

[摘要] Dirac and Lovász 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.

[学科分类] 统计和概率