{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:35:19Z","timestamp":1780097719538,"version":"3.54.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,2,1]],"date-time":"1986-02-01T00:00:00Z","timestamp":507600000000},"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":10028,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1986,2]]},"DOI":"10.1016\/0095-8956(86)90062-6","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"21-39","source":"Crossref","is-referenced-by-count":31,"title":["Concerning the achromatic number of graphs"],"prefix":"10.1016","volume":"40","author":[{"given":"Martin","family":"Farber","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gen\u0306a","family":"Hahn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Donald","family":"Miller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90062-6_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0095-8956(86)90062-6_BIB2","author":"Garey","year":"1979"},{"key":"10.1016\/0095-8956(86)90062-6_BIB3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum covering, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(86)90062-6_BIB4","first-page":"453","article-title":"An interpolation theorem for graphical homomorphisms","volume":"26","author":"Harary","year":"1967","journal-title":"Portugal Math."},{"key":"10.1016\/0095-8956(86)90062-6_BIB5","first-page":"213","article-title":"Homomorphism interpolation and approximation","volume":"15","author":"Hedrlin","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(86)90062-6_BIB6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1111\/j.1749-6632.1979.tb32801.x","article-title":"Graphs with forbidden homomorphic images","volume":"319","author":"Hell","year":"1979","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"10.1016\/0095-8956(86)90062-6_BIB7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(76)90099-6","article-title":"Graphs with given achromatic number","volume":"16","author":"Hell","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90062-6_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0024-3795(72)90023-7","article-title":"Eigenvalues and partitionings of the edges of a graph","volume":"5","author":"Hoffman","year":"1972","journal-title":"Linear Algebra Appl."},{"issue":"No. 4","key":"10.1016\/0095-8956(86)90062-6_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(86)90062-6_BIB10","article-title":"\u00c9tude du nombre achromatique des \u00e9toiles","author":"Lopez-Bracho","year":"1981"},{"key":"10.1016\/0095-8956(86)90062-6_BIB11","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0019-9958(81)90226-6","article-title":"On the complexity of the general coloring problem","volume":"51","author":"Maurer","year":"1981","journal-title":"Inform. and Control"},{"issue":"No. 2","key":"10.1016\/0095-8956(86)90062-6_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(81)90164-3","article-title":"A lower estimate for the achromatic number of irreducible graphs","volume":"33","author":"M\u00e1t\u00e9","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(86)90062-6_BIB13","series-title":"Algorithmic Aspects of Combinatorics","first-page":"91","article-title":"Subtree isomorphisms in O(n52)","volume":"Vol. 2","author":"Matula","year":"1978"},{"key":"10.1016\/0095-8956(86)90062-6_BIB14","author":"Papadimitriou","year":"1982"},{"issue":"No. 3","key":"10.1016\/0095-8956(86)90062-6_BIB15","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0138030","article-title":"Edge dominating sets in graphs","volume":"38","author":"Yannakakis","year":"1980","journal-title":"SIAM J. Appl. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900626?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900626?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:55:48Z","timestamp":1548759348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,2]]}},"alternative-id":["0095895686900626"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90062-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,2]]}}}