{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:20:47Z","timestamp":1773656447151,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf01194253","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T13:10:10Z","timestamp":1108732210000},"page":"145-160","source":"Crossref","is-referenced-by-count":43,"title":["Mixed graph colorings"],"prefix":"10.1007","volume":"45","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Julio","family":"Kuplinsky","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"de Werra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1145\/6617.6621","volume":"29","author":"MD Atkinson","year":"1986","unstructured":"Atkinson MD, Sack J-R, Santoro N, Strothotte T (1986) Min-max heaps and generalized priority queues. Communications of the Association for Computing Machinery 29:996?1000","journal-title":"Communications of the Association for Computing Machinery"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E Balas","year":"1969","unstructured":"Balas E (1969) Machine sequencing via disjunctive graphs: An implicit enumeration approach. Operations Research 17:941?957","journal-title":"Operations Research"},{"key":"CR3","volume-title":"Theory of graphs ? proceedings of the colloquium held at Tihany","author":"T Gallai","year":"1968","unstructured":"Gallai T (1968) On directed paths and circuits. In: Erd\u00f6s P, Katona G (Eds.) Theory of graphs ? proceedings of the colloquium held at Tihany, Hungary. Academic Press"},{"key":"CR4","unstructured":"Matula DW, Marble G, Isaacson JD (1972) Graph coloring algorithms. In: Read RC (Ed.) Graph Theory and Computing. Academic Press"},{"key":"CR5","first-page":"69","volume":"38","author":"B Roy","year":"1966","unstructured":"Roy B (1966) Prise en compte des contraintes disjonctives dans les m\u00e9thodes de chemin critique. RAIRO 38:69?84","journal-title":"RAIRO"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1051\/m2an\/1967010501291","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy B (1967) Nombre chromatique et plus longs chemins d'un graphe. Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationnelle 1:129?132","journal-title":"Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationnelle"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Tarjan RE (1983) Data structures and network algorithms. SIAM","DOI":"10.1137\/1.9781611970265"},{"key":"CR8","first-page":"1687","volume":"no 6","author":"LM Vitaver","year":"1962","unstructured":"Vitaver LM (1962) Determination of minimal colorings for vertices of a graph by means of Boolean powers of the adjacency martix. Soviet Mathematics ? Doklady 3, no 6:1687?1688","journal-title":"Soviet Mathematics ? Doklady 3"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194253.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01194253\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:09:32Z","timestamp":1556629772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01194253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF01194253"],"URL":"https:\/\/doi.org\/10.1007\/bf01194253","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}