{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:06:42Z","timestamp":1776874002638,"version":"3.51.2"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":7747,"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":[[1992,5]]},"DOI":"10.1016\/0012-365x(92)90319-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"271-277","source":"Crossref","is-referenced-by-count":30,"title":["On the chromatic number of cube-like graphs"],"prefix":"10.1016","volume":"103","author":[{"given":"Charles","family":"Payan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90319-B_BIB1","article-title":"Generalized hypercubes and graph embedding with dilation","volume":"40","author":"Dvorak","year":"1989","journal-title":"Math. Kolloq."},{"key":"10.1016\/0012-365X(92)90319-B_BIB2","series-title":"Recent Advances in Graph Theory","first-page":"249","article-title":"Four difficult unsolved problems in graph theory","author":"Harary","year":"1974"},{"key":"10.1016\/0012-365X(92)90319-B_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(82)90139-X","article-title":"Another characterization of hypercubes","volume":"39","author":"Hebbare","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90319-B_BIB4","unstructured":"F. Jaeger, private communication."},{"key":"10.1016\/0012-365X(92)90319-B_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0095-8956(88)90053-6","article-title":"Matroidal bijections between graphs","volume":"45","author":"Linial","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90319-B_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(79)90095-5","article-title":"(0,\u03bb)-graphs and n-cubes","volume":"28","author":"Mulder","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90319-B_BIB7","doi-asserted-by":"crossref","first-page":"308","DOI":"10.21136\/CPM.1987.118312","article-title":"The chromatic number of extended odd graphs is four","volume":"112","author":"Sokolova","year":"1987","journal-title":"\u010casopis P\u011bst. Mat."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290319B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290319B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:23:46Z","timestamp":1621031026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290319B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0012365X9290319B"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90319-b","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}