References
- BergeC.von GraphenFärbung, deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung) Wissenschaftliche Zeitschrift1961Martin Luther Universität Halle-Wittenberg, mathematisch-naturwissenschaftliche Reihe114–115
- GrötschelM.LovászL.SchrijverA., The ellipsoid method and its consequences in combinatorial optimization Combinatorica 11981 169–197
- ChudnovskyM.RobertsonN.SeymourP.ThomasR., The strong perfect graph theorem Ann. of Math. (2) 1642006 51–229
- Neumann-LaraV., The dichromatic number of a digraph J. Combin. Theory Ser. B 331982 265–270
- BokalD.FijavžG.JuvanM.KayllP.M.MoharB., The circular chromatic number of a digraph J. Graph Theory 462004 227–240
- AndresS.D.HochstättlerW., Perfect digraphs J. Graph Theory 792015 21–29
- BorosE.GurvichV., graphs Perfect. kernels Perfect graphs kernels and cores of cooperative games Discrete Math. 3062006 2336–2354
- FraenkelA.S., Combinatorial game theory foundations applied to digraph kernels Electronic J. Combin. 41997#R10
- Galeana-SánchezH.Sánchez-LópezR., Richardson’s theorem in H-coloured digraphs Graphs Combin. 322016 629–638
- LovászL., Normal hypergraphs and the perfect graph conjecture Discrete Math. 21972 253–267
- BorosE.GurvichV., Perfect graphs are kernel solvable Discrete Math. 1591996 35–55
- GolumbicM.C.Algorithmic Graph Theory and Perfect Graphssecond ed.Annals of Discrete Mathematics vol. 572004ElsevierAmsterdam
- BodlaenderH.L., On the complexity of some coloring games Internat. J. Found. Comput. Sci. 21991 133–147
- AndresS.D., On characterizing game-perfect graphs by forbidden induced subgraphs Contrib. Discrete Math. 72012 21–34
- LockE., The structure of gB-perfect graphs(Bachelor’s Thesis) 2016FernUniversität in Hagen
- S.D. Andres, E. Lock, Characterising and recognising game-perfect graphs, Submitted,https://arxiv.org/abs/1810.12439.
- YangD.ZhuX., Game colouring directed graphs Electron. J. Combin. 172010#R11
- AndresS.D., Lightness of digraphs in surfaces and directed game chromatic number Discrete Math. 3092009 3564–3579
- AndresS.D., Game-perfect digraphs Math. Methods Oper. Res. 762012 321–341
- ChanW.H.ShiuW.C.SunP.K.ZhuX., The strong game colouring number of directed graphs Discrete Math. 3132013 1070–1077
- Bang-JensenJ.GutinG., Digraphs. Theory, Algorithms and Applications2009second ed.London
- S.D. Andres, C. Charpentier, W.L. Fong, Game-perfect directed forests, Unpublished results.