pdfformat: 

@InProceedings{chudnovsky_et_al:LIPIcs:2019:11152, author = {Maria Chudnovsky and Shenwei Huang and Pawel Rzazewski and Sophie Spirkl and Mingxian Zhong}, title = {{Complexity of C_kColoring in Hereditary Classes of Graphs}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {31:131:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771245}, ISSN = {18688969}, year = {2019}, volume = {144}, editor = {Michael A. Bender and Ola Svensson and Grzegorz Herman}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11152}, URN = {urn:nbn:de:0030drops111529}, doi = {10.4230/LIPIcs.ESA.2019.31}, annote = {Keywords: homomorphism, hereditary class, computational complexity, forbidden induced subgraph} }
Keywords:  homomorphism, hereditary class, computational complexity, forbidden induced subgraph  
Seminar:  27th Annual European Symposium on Algorithms (ESA 2019)  
Issue date:  2019  
Date of publication:  06.09.2019 