{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:44:06Z","timestamp":1767339846136},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"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":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90165-p","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"305-312","source":"Crossref","is-referenced-by-count":44,"title":["Bounded vertex colorings of graphs"],"prefix":"10.1016","volume":"111","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[]},{"given":"Julio","family":"Kuplinsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90165-P_BIB1","article-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/0012-365X(93)90165-P_BIB2","series-title":"Extremal Graph Theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/0012-365X(93)90165-P_BIB3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On coloring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(93)90165-P_BIB4","series-title":"A Guide to the Theory of NP-completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(93)90165-P_BIB5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(93)90165-P_BIB6","series-title":"Combinatorial Theory and its Applications","first-page":"601","article-title":"Proof of a conjecture of P. Erd\u00f6s","author":"Hajnal","year":"1970"},{"key":"10.1016\/0012-365X(93)90165-P_BIB7","unstructured":"P. Hansen, A. Hertz, B. Jaumard and J. Kuplinsky, Weight-constrained minimum diameter clustering, in preparation."},{"key":"10.1016\/0012-365X(93)90165-P_BIB8","series-title":"Proc. 10th ACM Symp. on the Theory of Computing","first-page":"240","article-title":"On the complexity of a generalized matching problem","author":"Kirkpatrick","year":"1978"},{"key":"10.1016\/0012-365X(93)90165-P_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(82)80002-7","article-title":"Chromatic optimization: limitations, objectives, uses, references,","volume":"11","author":"Krarup","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0012-365X(93)90165-P_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90165-P_BIB11","first-page":"17","article-title":"An O(\u221a|V|E) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980","journal-title":"Proc. 21st Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0012-365X(93)90165-P_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(93)90165-P_BIB13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","article-title":"Critical perfect graphs and perfect 3-chromatic graphs","volume":"23","author":"Tucker","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90165-P_BIB14","series-title":"Integer Programming and Combinatorial Optimization","first-page":"509","article-title":"A theory of alternating paths and blossoms for proving correctness of the O(\u221a|V|E) general graph matching algorithm","author":"Vazirani","year":"1990"},{"key":"10.1016\/0012-365X(93)90165-P_BIB15","first-page":"2","article-title":"Some uses of hypergraphs in timetabling","volume":"2","author":"de Werra","year":"1985","journal-title":"Asia-Pacific J. Oper. Res."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390165P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390165P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:51:48Z","timestamp":1555120308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390165P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390165P"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90165-p","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}