{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:25:03Z","timestamp":1648963503540},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"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":10365,"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":[[1985,3]]},"DOI":"10.1016\/0012-365x(85)90060-3","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"31-37","source":"Crossref","is-referenced-by-count":3,"title":["On the chromatic number of certain highly symmetric graphs"],"prefix":"10.1016","volume":"54","author":[{"given":"P.P","family":"P\u00e1lfy","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90060-3_BIB1","first-page":"258","article-title":"Sur le couplage maximum d'un graphe","volume":"247","author":"Berge","year":"1958","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(85)90060-3_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0012-365X(85)90060-3_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0095-8956(80)90069-6","article-title":"A note on Hamiltonian split graphs","volume":"28","author":"Burkard","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(85)90060-3_BIB4","series-title":"Graph Theory\u2014An Algorithmic Approach","author":"Christofides","year":"1975"},{"key":"10.1016\/0012-365X(85)90060-3_BIB5","series-title":"Computers and Intractibility","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0012-365X(85)90060-3_BIB6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/990518.990521","article-title":"An NP-hard problem in bipartite graphs","volume":"7","author":"Krishnamoorthy","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0012-365X(85)90060-3_BIB7","series-title":"The Many Facets of Graph Theory","first-page":"237","article-title":"Hamiltonian circuits in graphs and diagraphs","author":"Nash-Williams","year":"1969"},{"key":"10.1016\/0012-365X(85)90060-3_BIB8","article-title":"Hamiltonsche Graphen\u2014Notwendige Bedingungen und Algorithmen","author":"Peem\u00f6ller","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900603?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900603?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:51:34Z","timestamp":1553946694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85900603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0012365X85900603"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90060-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}