{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:09Z","timestamp":1753893789581,"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>We construct a graph of order 384, the smallest known trivalent graph of girth 14.<\/jats:p>","DOI":"10.37236\/1664","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:27:12Z","timestamp":1578709632000},"source":"Crossref","is-referenced-by-count":1,"title":["A Small Trivalent Graph of Girth 14"],"prefix":"10.37236","volume":"9","author":[{"given":"Geoffrey","family":"Exoo","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2002,3,11]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n3\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n3\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:15:19Z","timestamp":1579324519000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v9i1n3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3,11]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2002,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1664","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2002,3,11]]},"article-number":"N3"}}