{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:30Z","timestamp":1753893810162,"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>Let $g(n)$ denote the minimum number of edges of a maximal nontraceable graph of order $n$.  Dudek, Katona and Wojda (2003) showed that $ g(n) \\geq \\lceil {3n-2\\over2} \\rceil -2$ for $ n \\ge 20$ and $ g(n) \\le \\lceil {3n-2\\over2} \\rceil$ for $ n \\geq 54$ as well as for $n \\in I= \\{22,23,30,31,38,39,40,41,42,43,46,$ $47,48,49,50,51\\}$.  We show that $ g(n) = \\lceil {3n-2\\over2} \\rceil$ for $ n \\geq 54$ as well as for $n \\in I \\cup \\{12,13\\}$ and we determine $g(n)$ for $n \\le 9$.<\/jats:p>","DOI":"10.37236\/1929","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T05:11:21Z","timestamp":1578719481000},"source":"Crossref","is-referenced-by-count":4,"title":["Lower Bound for the Size of Maximal Nontraceable Graphs"],"prefix":"10.37236","volume":"12","author":[{"given":"Marietjie","family":"Frick","sequence":"first","affiliation":[]},{"given":"Joy","family":"Singleton","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2005,7,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1r32\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v12i1r32\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:48:20Z","timestamp":1579322900000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v12i1r32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,19]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1929","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2005,7,19]]},"article-number":"R32"}}