{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:19:09Z","timestamp":1648869549109},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> Although the notion of a two-pair (a pair of vertices between which all induced paths have length 2) was invented for the class of weakly chordal graphs, two-pairs can also play a fundamental role for smaller graph classes. Indeed, two-pairs and chords of cycles can collaborate symmetrically to give parallel characterizations of weakly chordal, chordal, and strongly chordal graphs (and of distance-hereditary graphs). <\/jats:p>","DOI":"10.1142\/s1793830914500311","type":"journal-article","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T00:48:52Z","timestamp":1392857332000},"page":"1450031","source":"Crossref","is-referenced-by-count":0,"title":["Symmetric graph-theoretic roles of two-pairs and chords of cycles"],"prefix":"10.1142","volume":"06","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Wright State University, Dayton, Ohio 45435, USA"}]}],"member":"219","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90043-2"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-005-0507-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90154-1"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90050-4"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1093\/qmath\/28.4.417"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.08.063"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)E0161-Q"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:15:45Z","timestamp":1565097345000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":10,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2014,6,16]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S1793830914500311"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500311","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]}}}