{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:10Z","timestamp":1753893850119,"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 give a short proof of Gao and Richter's theorem that every circuit graph contains a closed walk visiting each vertex once or twice.<\/jats:p>","DOI":"10.37236\/459","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:17:07Z","timestamp":1578716227000},"source":"Crossref","is-referenced-by-count":1,"title":["A Note on Circuit Graphs"],"prefix":"10.37236","volume":"17","author":[{"given":"Qing","family":"Cui","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2010,1,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n10\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1n10\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:59:31Z","timestamp":1579305571000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1n10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/459","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,1,31]]},"article-number":"N10"}}