{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:07:16Z","timestamp":1773670036688,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,11,4]],"date-time":"2006-11-04T00:00:00Z","timestamp":1162598400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2006,12,28]]},"DOI":"10.1007\/s10878-006-9019-3","type":"journal-article","created":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T15:50:49Z","timestamp":1162569049000},"page":"163-178","source":"Crossref","is-referenced-by-count":10,"title":["On edge orienting methods for graph coloring"],"prefix":"10.1007","volume":"13","author":[{"given":"Bernard","family":"Gendron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"St-Louis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,4]]},"reference":[{"key":"9019_CR1","first-page":"107","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, New Jersey, pp 107\u2013108"},{"issue":"1","key":"9019_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/B:JOCO.0000021937.26468.b2","volume":"8","author":"VC Barbosa","year":"2004","unstructured":"Barbosa VC, Assis CAG, Do Nascimento JO (2004) Two novel evolutionary formulations of the graph coloring problem. J Comb Optim 8(1):41\u201363","journal-title":"J Comb Optim"},{"issue":"4","key":"9019_CR3","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"JR Brown","year":"1972","unstructured":"Brown JR (1972) Chromatic scheduling and the chromatic number problem. Manag Sci 19(4):456\u2013463","journal-title":"Manag Sci"},{"key":"9019_CR4","doi-asserted-by":"crossref","unstructured":"Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput & Oper Res (to appear)","DOI":"10.1016\/j.cor.2005.07.028"},{"key":"9019_CR5","unstructured":"Gallai T (1968) On directed paths and circuits. In: Erd\u00f6s P, Katobna G (eds) Theory of graphs. Academic Press, Tihany, New York, pp 115\u2013118"},{"key":"9019_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freman and Company, NY"},{"key":"9019_CR7","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (eds) (1997) Tabu search. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"10","key":"9019_CR8","first-page":"1","volume":"7","author":"F Herrmann","year":"2002","unstructured":"Herrmann F, Hertz A (2002) Finding the chromatic number by means of critical graphs. ACM J Exp Alg 7(10):1\u20139","journal-title":"ACM J Exp Alg"},{"key":"9019_CR9","unstructured":"Johnson DS, Trick MA (1996) Proceedings of the 2nd DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, American Mathematical Society"},{"issue":"4","key":"9019_CR10","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M Kubale","year":"1985","unstructured":"Kubale M, Jackowski B (1985) A generalized implicit enumeration algorithm for graph coloring. Comm ACM 28(4):412\u2013418","journal-title":"Comm ACM"},{"issue":"4","key":"9019_CR11","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra A, Trick MA (1996) A column generation approach for exact graph coloring. INFORMS J Comput 8(4):344\u2013354","journal-title":"INFORMS J Comput"},{"issue":"8","key":"9019_CR12","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1145\/358161.358171","volume":"26","author":"J Peem\u00f6ller","year":"1983","unstructured":"Peem\u00f6ller J (1983) A correction to Br\u00e9laz\u2019s modification of Brown\u2019s coloring algorithm. Comm ACM 26(8):593\u2013597","journal-title":"Comm ACM"},{"key":"9019_CR13","first-page":"127","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy B (1967) Nombre chromatique et plus longs chemins d\u2019un graphe. Revue AFIRO 1:127\u2013132","journal-title":"Revue AFIRO"},{"issue":"1","key":"9019_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"PJM Van Laarhoven","year":"1992","unstructured":"Van Laarhoven PJM, Aarts EHL, Lenstra JK (1992) Job-shop scheduling by simulated annealing. Oper Res 40(1):113\u2013125","journal-title":"Oper Res"},{"key":"9019_CR15","unstructured":"Vitaver LM (1962) Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix. Dokl Akad Nauk SSSR147 758\u2013759 (in Russian)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9019-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9019-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9019-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9019-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,12,28]]}},"alternative-id":["9019"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9019-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,4]]}}}