{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:55Z","timestamp":1753893835687,"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 nonplanar graph $G$ is called almost-planar if for every edge $e$ of $G$, at least one of $G\\backslash e$ and $G\/e$ is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published. The main purpose of this paper is to provide a short proof of this result. We also discuss the structure of almost-planar graphs that are not 3-connected.<\/jats:p>","DOI":"10.37236\/6591","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T10:36:10Z","timestamp":1578652570000},"source":"Crossref","is-referenced-by-count":1,"title":["On Almost-Planar Graphs"],"prefix":"10.37236","volume":"25","author":[{"given":"Guoli","family":"Ding","sequence":"first","affiliation":[]},{"given":"Joshua","family":"Fallon","sequence":"additional","affiliation":[]},{"given":"Emily","family":"Marshall","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2018,3,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i1p55\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i1p55\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:37:27Z","timestamp":1579217847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i1p55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,1,12]]}},"URL":"https:\/\/doi.org\/10.37236\/6591","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,3,16]]},"article-number":"P1.55"}}