On the complexity of rainbow coloring problems

DOI10.1016/J.DAM.2016.10.021MaRDI QIDQ6827502zbMATH OpenFDO

Authors Eduard Eiben, Robert Ganian, Juho Lauri

Publication date 27 June 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treewidthgraph algorithmsrainbow connection numberrainbow coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On the complexity of rainbow coloring problems

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