Approximately coloring graphs without long induced paths

DOI10.1007/978-3-319-68705-6_15MaRDI QIDQ6830175zbMATH OpenFDO

Authors Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong

Publication date 4 January 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://repositorio.uchile.cl/handle/2250/169058

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Approximately coloring graphs without long induced paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830175)