Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Bodlaender:1992:CCG, author = "Hans L. Bodlaender and Dieter Kratsch", title = "The complexity of coloring games on perfect graphs", journal = j-THEOR-COMP-SCI, volume = "106", number = "2", pages = "309--326", day = "14", month = dec, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:51 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=106&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=106&issue=2&aid=1332", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bipartite graphs; coloring games; complexity; computational complexity; game theory; graph colouring; interval graphs; perfect graphs; split graphs; winning strategy", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }