{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:17:27Z","timestamp":1763619447470},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0012-365x(93)90512-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"131-142","source":"Crossref","is-referenced-by-count":21,"title":["A characterization and hereditary properties for partition graphs"],"prefix":"10.1016","volume":"113","author":[{"given":"Kevin","family":"McAvaney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Robertson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duane","family":"DeTemple","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90512-R_bib1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)90512-R_bib2","first-page":"121","article-title":"Partition graphs","volume":"13","author":"DeTemple","year":"1987","journal-title":"Soochow J. Math."},{"key":"10.1016\/0012-365X(93)90512-R_bib3","first-page":"50","article-title":"Constructions and the realization problem for partition graphs","volume":"13","author":"DeTemple","year":"1988","journal-title":"J. Combin. Inform. Systems Sci."},{"key":"10.1016\/0012-365X(93)90512-R_bib4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1017\/S1446788700033115","article-title":"Graphs associated with triangulations of lattice polygons","volume":"A 47","author":"DeTemple","year":"1989","journal-title":"J. Austral. Math. Soc. Ser."},{"key":"10.1016\/0012-365X(93)90512-R_bib5","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(93)90512-R_bib6","first-page":"135","article-title":"Partition intersection graphs","volume":"16B","author":"McMorris","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90512-R_bib7","series-title":"Applied Combinatorics","author":"Roberts","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390512R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390512R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:52:30Z","timestamp":1555120350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390512R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0012365X9390512R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90512-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}