{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:51:47Z","timestamp":1648525907597},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0012-365x(91)90434-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"191-198","source":"Crossref","is-referenced-by-count":1,"title":["Transitive multipermutation graphs: Case 4 \u2a7d n \u2a7d m"],"prefix":"10.1016","volume":"97","author":[{"given":"Mario","family":"Gionfriddo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Milazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Vacirca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90434-4_BIB1","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0012-365X(91)90434-4_BIB2","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"Chartrand","year":"1967","journal-title":"Ann. Inst. H. Poincare Sect B"},{"key":"10.1016\/0012-365X(91)90434-4_BIB3","first-page":"21","article-title":"On the chromatic number of permutation graph","author":"Chartrand","year":"1969","journal-title":"Proof Techniques in Graph Theory"},{"key":"10.1016\/0012-365X(91)90434-4_BIB4","first-page":"267","article-title":"On the chromatic number of multipermutation graphs","volume":"25C","author":"Gionfriddo","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(91)90434-4_BIB5","first-page":"413","article-title":"On the chromatic number of transitive multipermutation graphs","volume":"1","author":"Gionfriddo","year":"1990","journal-title":"Research and Lecture Notes in Math."},{"key":"10.1016\/0012-365X(91)90434-4_BIB6","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"3","key":"10.1016\/0012-365X(91)90434-4_BIB7","article-title":"Edge colourings of permutation graphs","volume":"23","author":"Zelinka","year":"1973","journal-title":"Matematicky Casopis"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91904344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91904344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:26:19Z","timestamp":1555115179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X91904344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0012365X91904344"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90434-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}