{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:39Z","timestamp":1753893819612,"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>Gr\u00fcnbaum and Malkevitch proved that the shortness coefficient of cyclically 4-edge-connected cubic planar graphs is at most 76\/77. Recently, this was improved to 359\/366 (&lt; 52\/53) and the question was raised whether this can be strengthened to 41\/42, a natural bound inferred from one of the Faulkner-Younger graphs. We prove that the shortness coefficient of cyclically 4-edge-connected cubic planar graphs is at most 37\/38 and that we also get the same value for cyclically 4-edge-connected cubic graphs of genus g for any prescribed genus g \u2265 0. We also show that 45\/46 is an upper bound for the shortness coefficient of cyclically 4-edge-connected cubic graphs of genus g with face lengths bounded above by some constant larger than 22 for any prescribed g \u2265 0.<\/jats:p>","DOI":"10.37236\/8440","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T05:04:57Z","timestamp":1581051897000},"source":"Crossref","is-referenced-by-count":1,"title":["Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs"],"prefix":"10.37236","volume":"27","author":[{"given":"On-Hei S.","family":"Lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens M.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Van Cleemput","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carol T.","family":"Zamfirescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,2,7]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p43\/8030","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p43\/8030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T05:04:58Z","timestamp":1581051898000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,7]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8440","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,2,7]]},"article-number":"P1.43"}}