{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:53Z","timestamp":1753893833579,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A digraph is $k$-traceable if its order is at least $k$ and each of its subdigraphs of order $k$ is traceable.\u00a0 The Traceability Conjecture (TC) states that for $k\\geq 2$ every $k$-traceable oriented graph of order at least $2k-1$ is traceable. It has been shown that for $2\\leq k\\leq 6$, every $k$-traceable oriented graph is traceable. We develop an iterative procedure to extend previous results regarding the TC. In particular, we prove that every $7$-traceable oriented graph of order at least 9 is traceable and every 8-traceable graph of order at least 14 is traceable.<\/jats:p>","DOI":"10.37236\/2498","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:57:01Z","timestamp":1578711421000},"source":"Crossref","is-referenced-by-count":2,"title":["An Iterative Approach to the Traceability Conjecture for Oriented Graphs"],"prefix":"10.37236","volume":"20","author":[{"given":"Susan","family":"Van Aardt","sequence":"first","affiliation":[]},{"given":"Alewyn","family":"Burger","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Dunbar","sequence":"additional","affiliation":[]},{"given":"Marietjie","family":"Frick","sequence":"additional","affiliation":[]},{"given":"John","family":"Harris","sequence":"additional","affiliation":[]},{"given":"Joy","family":"Singleton","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,3,24]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p59\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:25:17Z","timestamp":1579260317000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,24]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2498","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,3,24]]},"article-number":"P59"}}