{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:23Z","timestamp":1740155963111,"version":"3.37.3"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p> Edges that are the unique chords of at least one cycle have been studied by a variety of authors over the past dozen years. This paper begins the study of those graphs in which each edge is the unique chord of exactly one cycle. The [Formula: see text]-connected planar graphs that enjoy this restriction are characterized by two infinite sequences (the dipyramid and trapezohedron [Formula: see text]-polytopes) together with three special graphs (the [Formula: see text]-antiprism, and the [Formula: see text]- and [Formula: see text]-prism graphs). <\/jats:p>","DOI":"10.1142\/s1793830920500561","type":"journal-article","created":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T13:40:06Z","timestamp":1591278006000},"page":"2050056","source":"Crossref","is-referenced-by-count":0,"title":["Unique chords of unique cycles in 3-connected planar graphs"],"prefix":"10.1142","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0745-6716","authenticated-orcid":false,"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[{"name":"Department of Mathematics & Statistics, Wright State University, Dayton, Ohio 45435, USA"}]}],"member":"219","published-online":{"date-parts":[[2020,6,4]]},"reference":[{"key":"S1793830920500561BIB001","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"S1793830920500561BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.10.005"},{"volume-title":"Polyhedra","year":"1997","author":"Cromwell P. R.","key":"S1793830920500561BIB003"},{"key":"S1793830920500561BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"S1793830920500561BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.03.024"},{"key":"S1793830920500561BIB006","first-page":"217","volume":"73","author":"McKee T. A.","year":"2007","journal-title":"Util. Math."},{"key":"S1793830920500561BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22214"},{"key":"S1793830920500561BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20405"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T09:57:42Z","timestamp":1597312662000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,4]]},"references-count":8,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.1142\/S1793830920500561"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500561","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,6,4]]}}}