{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T07:10:42Z","timestamp":1781161842602,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0012-365x(93)e0091-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"349-358","source":"Crossref","is-referenced-by-count":9,"title":["The chromaticity of s-bridge graphs and related graphs"],"prefix":"10.1016","volume":"135","author":[{"given":"Shaoji","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinjie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yeehock","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)E0091-H_BIB1","first-page":"121","article-title":"On chromatic equivalence of graphs","volume":"642","author":"Chao","year":"1978"},{"key":"10.1016\/0012-365X(93)E0091-H_BIB2","first-page":"111","article-title":"Chromatic polynomials of a family of graphs","volume":"15","author":"Chao","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)E0091-H_BIB3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(78)90012-2","article-title":"Chromatic uniqueness of the generalized \u0398-graph","volume":"23","author":"Loerinc","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)E0091-H_BIB4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/jgt.3190140110","article-title":"The chromaticity of complete bipartite graphs with at most one edge deleted","volume":"14","author":"Teo","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)E0091-H_BIB5","first-page":"315","article-title":"A lemma in studying chromaticity","volume":"32","author":"Xu","year":"1991","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)E0091-H_BIB6","unstructured":"Shaoji Xu, Classes of chromatically equivalent graphs and polygon trees, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0091H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93E0091H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:45Z","timestamp":1555136565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93E0091H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0012365X93E0091H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)e0091-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}