{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:45Z","timestamp":1753893825721,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Dirac and Lov\u00e1sz 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.<\/jats:p>","DOI":"10.37236\/10198","type":"journal-article","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T07:20:13Z","timestamp":1685690413000},"source":"Crossref","is-referenced-by-count":0,"title":["Rooted Prism-Minors and Disjoint Cycles Containing a Specified Edge"],"prefix":"10.37236","volume":"30","author":[{"given":"J.P.","family":"Costalonga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.J.","family":"Reid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2023,6,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i2p38\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v30i2p38\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T07:20:13Z","timestamp":1685690413000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v30i2p38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,4,7]]}},"URL":"https:\/\/doi.org\/10.37236\/10198","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2023,6,2]]},"article-number":"P2.38"}}