{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:10:09Z","timestamp":1751659809752,"version":"3.41.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\mathcal{H}$ be a set of connected graphs. A graph is said to be $\\mathcal{H}$-free if it does not contain an induced subgraph isomorphic a member of $\\mathcal{H}$. A graph is called traceable if it has a path containing all its vertices. In 1997, Faudree and Gould characterized all pairs $R$, $S$ such that every connected $\\{R, S\\}$-free graph is traceable. In this paper, we extend this result by considering 2-connected graphs, and characterize all pairs $R$, $S$ such that every 2-connected $\\{R, S\\}$-free graph is traceable. Furthermore, we characterize all 2-connected $\\{K_{1,3},N_{1,3,4}\\}$-free non-traceable graphs.<\/jats:p>","DOI":"10.37236\/12175","type":"journal-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T19:55:01Z","timestamp":1751658901000},"source":"Crossref","is-referenced-by-count":0,"title":["Forbidden Pairs for Traceability of 2-Connected Graphs"],"prefix":"10.37236","volume":"32","author":[{"given":"Shipeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2025,7,4]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p5\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v32i3p5\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T19:55:01Z","timestamp":1751658901000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v32i3p5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,4]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/12175","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,4]]}}}