{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:15:22Z","timestamp":1786979722816,"version":"build-2736575974"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,23]],"date-time":"2012-09-23T00:00:00Z","timestamp":1348358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s00186-012-0401-x","type":"journal-article","created":{"date-parts":[[2012,9,22]],"date-time":"2012-09-22T09:27:20Z","timestamp":1348306040000},"page":"321-341","source":"Crossref","is-referenced-by-count":4,"title":["Game-perfect digraphs"],"prefix":"10.1007","volume":"76","author":[{"given":"Stephan Dominique","family":"Andres","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,9,23]]},"reference":[{"key":"401_CR1","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.dam.2005.05.031","volume":"154","author":"SD Andres","year":"2006","unstructured":"Andres SD (2006) The game chromatic index of forests of maximum degree \u0394\u00a0\u2265\u00a05. Discret Appl Math 154: 1317\u20131323","journal-title":"Discret Appl Math"},{"key":"401_CR2","doi-asserted-by":"crossref","first-page":"3564","DOI":"10.1016\/j.disc.2007.12.060","volume":"309","author":"SD Andres","year":"2009","unstructured":"Andres SD (2009a) Lightness of digraphs in surfaces and directed game chromatic number. Discret Math 309: 3564\u20133579","journal-title":"Discret Math"},{"key":"401_CR3","doi-asserted-by":"crossref","first-page":"5799","DOI":"10.1016\/j.disc.2008.03.022","volume":"309","author":"SD Andres","year":"2009","unstructured":"Andres SD (2009b) Asymmetric directed graph coloring games. Discret Math. 309: 5799\u20135802","journal-title":"Discret Math."},{"key":"401_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00186-008-0256-3","volume":"69","author":"SD Andres","year":"2009","unstructured":"Andres SD (2009c) Game-perfect graphs. Math Methods Oper Res 69: 235\u2013250","journal-title":"Math Methods Oper Res"},{"key":"401_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.dam.2009.04.025","volume":"158","author":"SD Andres","year":"2010","unstructured":"Andres SD (2010) Directed defective asymmetric graph coloring games. Discret Appl Math 158: 251\u2013260","journal-title":"Discret Appl Math"},{"key":"401_CR6","first-page":"21","volume":"7","author":"SD Andres","year":"2012","unstructured":"Andres SD (2012) On characterizing game-perfect graphs by forbidden induced subgraphs. Contrib Discret Math 7: 21\u201334","journal-title":"Contrib Discret Math"},{"key":"401_CR7","unstructured":"Andres SD, Hochst\u00e4ttler W (2011) A strong perfect digraph theorem (submitted for publication)"},{"key":"401_CR8","volume-title":"Digraphs. Theory, algorithms and applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen J, Gutin G (2009) Digraphs. Theory, algorithms and applications. Springer, London"},{"key":"401_CR9","doi-asserted-by":"crossref","first-page":"R72","DOI":"10.37236\/796","volume":"15","author":"T Bartnicki","year":"2008","unstructured":"Bartnicki T, Bre\u0161ar B, Grytczuk J, Kov\u0161e M, Miechowicz Z, Peterin I (2008) Game chromatic number of Cartesian product graphs. Electron J Comb 15: R72","journal-title":"Electron J Comb"},{"key":"401_CR10","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1976","unstructured":"Berge C (1976) Graphs and hypergraphs. North Holland, Amsterdam"},{"key":"401_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0129054191000091","volume":"2","author":"HL Bodlaender","year":"1991","unstructured":"Bodlaender HL (1991) On the complexity of some coloring games. Int J Found Comput Sci 2: 133\u2013147","journal-title":"Int J Found Comput Sci"},{"key":"401_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/rsa.20179","volume":"32","author":"T Bohman","year":"2008","unstructured":"Bohman T, Frieze A, Sudakov B (2008) The game chromatic number of random graphs. Random Struct Algorithms 32: 223\u2013235","journal-title":"Random Struct Algorithms"},{"key":"401_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/jgt.20003","volume":"46","author":"D Bokal","year":"2004","unstructured":"Bokal D, Fijav\u017e G, Juvan M, Kayll PM, Mohar B (2004) The circular chromatic number of a digraph. J Graph Theory 46: 227\u2013240","journal-title":"J Graph Theory"},{"key":"401_CR14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1002\/1097-0118(200103)36:3<144::AID-JGT1002>3.0.CO;2-F","volume":"36","author":"L Cai","year":"2001","unstructured":"Cai L, Zhu X (2001) Game chromatic index of k-degenerate graphs. J Graph Theory 36: 144\u2013155","journal-title":"J Graph Theory"},{"key":"401_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky M, Robertson N, Seymour P, Thomas R (2006) The strong perfect graph theorem. Ann Math 164: 51\u2013229","journal-title":"Ann Math"},{"key":"401_CR16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.tcs.2002.10.002","volume":"313","author":"P Erd\u00f6s","year":"2004","unstructured":"Erd\u00f6s P, Faigle U, Hochst\u00e4ttler W, Kern W (2004) Note on the game chromatic index of trees. Theor Comput Sci 313: 371\u2013376","journal-title":"Theor Comput Sci"},{"key":"401_CR17","doi-asserted-by":"crossref","first-page":"4514","DOI":"10.1016\/j.disc.2009.02.014","volume":"309","author":"L Esperet","year":"2009","unstructured":"Esperet L, Zhu X (2009) Game colouring the square of graphs. Discrete Math 309: 4514\u20134521","journal-title":"Discrete Math"},{"key":"401_CR18","first-page":"143","volume":"35","author":"U Faigle","year":"1993","unstructured":"Faigle U, Kern W, Kierstead H, Trotter WT (1993) On the game chromatic number of some classes of graphs. Ars Combin 35: 143\u2013150","journal-title":"Ars Combin"},{"key":"401_CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/jgt.10069","volume":"41","author":"W He","year":"2002","unstructured":"He W, Hou X, Lih KW, Shao J, Wang W, Zhu X (2002) Edge-partitions of planar graphs and their game coloring numbers. J Graph Theory 41: 307\u2013317","journal-title":"J Graph Theory"},{"key":"401_CR20","first-page":"365","volume":"17","author":"H Jacob","year":"1983","unstructured":"Jacob H, Meyniel H (1983) Extension of Turan\u2019s and Brook\u2019s Theorems and new notions of stability and coloring in digraphs. Ann Discret Math 17: 365\u2013370","journal-title":"Ann Discret Math"},{"key":"401_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/jctb.1999.1927","volume":"78","author":"HA Kierstead","year":"2000","unstructured":"Kierstead HA (2000) A simple competitive graph coloring algorithm. J Comb Theory 78: 57\u201368","journal-title":"J Comb Theory"},{"key":"401_CR22","doi-asserted-by":"crossref","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. Discret Math 2: 253\u2013267","journal-title":"Discret Math"},{"key":"401_CR23","doi-asserted-by":"crossref","first-page":"R14","DOI":"10.37236\/1613","volume":"8","author":"J Ne\u0161et\u0159il","year":"2001","unstructured":"Ne\u0161et\u0159il J, Sopena E (2001) On the oriented game chromatic number. Electronic J Comb 8: R14","journal-title":"Electronic J Comb"},{"key":"401_CR24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"V Neumann-Lara","year":"1982","unstructured":"Neumann-Lara V (1982) The dichromatic number of a digraph. J Comb Theory B 33: 265\u2013270","journal-title":"J Comb Theory B"},{"key":"401_CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.ipl.2006.12.003","volume":"102","author":"E Sidorowicz","year":"2007","unstructured":"Sidorowicz E (2007) The game chromatic number and the game colouring number of cactuses. Inf Process Lett 102: 147\u2013151","journal-title":"Inf Process Lett"},{"key":"401_CR26","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1016\/j.disc.2007.05.023","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu J, Zhu X (2008) Lower bounds for the game colouring number of partial k-trees and planar graphs. Discret Math 308: 2637\u20132642","journal-title":"Discret Math"},{"key":"401_CR27","doi-asserted-by":"crossref","first-page":"R11","DOI":"10.37236\/283","volume":"17","author":"D Yang","year":"2010","unstructured":"Yang D, Zhu X (2010) Game colouring directed graphs. Electron J Combin 17: R11","journal-title":"Electron J Combin"},{"key":"401_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(99)00237-X","volume":"215","author":"X Zhu","year":"2000","unstructured":"Zhu X (2000) The game coloring number of pseudo partial k-trees. Discret Math 215: 245\u2013262","journal-title":"Discret Math"},{"key":"401_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2007.04.004","volume":"98","author":"X Zhu","year":"2008","unstructured":"Zhu X (2008) Refined activation strategy for the marking game. J Comb Theory B 98: 1\u201318","journal-title":"J Comb Theory B"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0401-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0401-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0401-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T23:21:46Z","timestamp":1594682506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0401-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,23]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0401-x","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,23]]}}}