{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:03:08Z","timestamp":1774594988636,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T00:00:00Z","timestamp":1645056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T00:00:00Z","timestamp":1645056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100011958","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["DFF-6109-000132"],"award-info":[{"award-number":["DFF-6109-000132"]}],"id":[{"id":"10.13039\/501100011958","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10479-021-04374-9","type":"journal-article","created":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T14:03:30Z","timestamp":1645106610000},"page":"963-983","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the properties of weighted minimum colouring games"],"prefix":"10.1007","volume":"318","author":[{"given":"Herbert","family":"Hamers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nayat","family":"Horozoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Norde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6234-3955","authenticated-orcid":false,"given":"Trine Torn\u00f8e","family":"Platz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,17]]},"reference":[{"key":"4374_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2007.12.009","volume":"107","author":"F Chu","year":"2008","unstructured":"Chu, F. (2008). A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements. Information Processing Letters, 107, 7\u201312. https:\/\/doi.org\/10.1016\/j.ipl.2007.12.009","journal-title":"Information Processing Letters"},{"key":"4374_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., & Vuskovic, K. (2005). Recognizing berge graphs. Combinatorica, 25, 143\u2013186. https:\/\/doi.org\/10.1007\/s00493-005-0012-8","journal-title":"Combinatorica"},{"issue":"1","key":"4374_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ejor.2009.09.029","volume":"204","author":"B \u00c7ift\u00e7i","year":"2010","unstructured":"\u00c7ift\u00e7i, B., Borm, P., & Hamers, H. (2010). Highway games on weakly cyclic graphs. European Journal of Operational Research, 204(1), 117\u2013124.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"4374_CR4","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D. G., Perl, Y., & Stewart, L. K. (1985). A linear recognition algorithm for cographs. SIAM Journal on Computing, 14(4), 926\u2013934. https:\/\/doi.org\/10.1137\/0214065","journal-title":"SIAM Journal on Computing"},{"key":"4374_CR5","unstructured":"Curiel, I. (1997). Cooperative game theory and applications: Cooperative games arising from combinatorial optimization problems. Kluwer Academic Publishers."},{"issue":"3","key":"4374_CR6","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., & Nagamochi, H. (1999). Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research, 24(3), 751\u2013766.","journal-title":"Mathematics of Operations Research"},{"key":"4374_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s101070050005","volume":"87","author":"X Deng","year":"2000","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H., & Zang, W. (2000). Totally balanced combinatorial optimization games. Mathematical Programming, 87, 441\u2013452.","journal-title":"Mathematical Programming"},{"key":"4374_CR8","doi-asserted-by":"crossref","unstructured":"Gillies, D. B. (1959). Contributions to the Theory of Games. In A. Tucker & R. Luce (Eds.), Solutions to general non-zero-sum games (pp. 47\u201385). Princeton University Press.","DOI":"10.1515\/9781400882168-005"},{"issue":"1\u20133","key":"4374_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(03)00225-7","volume":"134","author":"D Granot","year":"2004","unstructured":"Granot, D., & Hamers, H. (2004). On the equivalence between some local and global chinese postman and traveling salesman graphs. Discrete Applied Mathematics, 134(1\u20133), 67\u201376.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"4374_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s101070050093","volume":"86","author":"D Granot","year":"1999","unstructured":"Granot, D., Hamers, H., & Tijs, S. (1999). On some balanced, totally balanced and submodular delivery games. Mathematical Programming, 86(2), 355\u2013366.","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"4374_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0166-218X(99)00167-5","volume":"100","author":"D Granot","year":"2000","unstructured":"Granot, D., Granot, F., & Zhu, W. R. (2000). Naturally submodular digraphs and forbidden digraph configurations. Discrete Applied Mathematics, 100(1\u20132), 67\u201384.","journal-title":"Discrete Applied Mathematics"},{"key":"4374_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10107-013-0655-y","volume":"145","author":"H Hamers","year":"2014","unstructured":"Hamers, H., Miquel, S., & Norde, H. (2014). Monotonic stable solutions for minimum coloring games. Mathematical Programming, 145, 509\u2013529.","journal-title":"Mathematical Programming"},{"issue":"3","key":"4374_CR13","first-page":"673","volume":"123","author":"YT Herer","year":"1995","unstructured":"Herer, Y. T., & Penn, M. (1995). Characterizations of natural submodular graphs: A polynomially solvable class of the TSP. Proceedings of the American Mathematical Society, 123(3), 673\u2013679.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"3","key":"4374_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L. (1972). Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics, 2(3), 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"4374_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01753435","volume":"1","author":"M Maschler","year":"1971","unstructured":"Maschler, M., Peleg, B., & Shapley, L. S. (1971). The kernel and bargaining set for convex games. International Journal of Game Theory, 1, 73\u201393.","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"4374_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G","volume":"36","author":"C McDiarmid","year":"2000","unstructured":"McDiarmid, C., & Reed, B. (2000). Channel assignment and weighted coloring. Networks, 36(2), 114\u2013117.","journal-title":"Networks"},{"issue":"1","key":"4374_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s001860300284","volume":"58","author":"Y Okamoto","year":"2003","unstructured":"Okamoto, Y. (2003). Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research, 58(1), 131\u2013139.","journal-title":"Mathematical Methods of Operations Research"},{"key":"4374_CR18","unstructured":"Schrijver, A. (2003). Combinatorial optimization. Springer."},{"issue":"1","key":"4374_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1(1), 11\u201326.","journal-title":"International Journal of Game Theory"},{"issue":"4","key":"4374_CR20","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0899-8256(90)90006-G","volume":"2","author":"Y Sprumont","year":"1990","unstructured":"Sprumont, Y. (1990). Population monotonic allocation schemes for cooperative games with transferable utility. Games and Economic Behavior, 2(4), 378\u2013394.","journal-title":"Games and Economic Behavior"},{"key":"4374_CR21","doi-asserted-by":"crossref","unstructured":"W\u00f6lk, E. S. (1965). A note on\u201cthe comparability graph of a tree\u201d. Proceedings of the American Mathematical Society, 16, 17\u201320.","DOI":"10.1090\/S0002-9939-1965-0172274-5"},{"key":"4374_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","volume":"69","author":"J Yan","year":"1996","unstructured":"Yan, J., Chen, J., & Chang, G. J. (1996). Quasi-threshold graphs. Discrete Applied Mathematics, 69, 247\u2013255.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04374-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04374-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04374-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T22:01:33Z","timestamp":1668031293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04374-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,17]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["4374"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04374-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,17]]},"assertion":[{"value":"19 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}