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)

Full work available at URL https://doi.org/10.1016/J.DAM.2016.10.021

zbMATH Keywords

graph algorithmsrainbow coloringrainbow connection numbertreewidth

Mathematics Subject Classification ID

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

Cited in

(2)

• On the complexity of rainbow vertex colouring diametral path graphs
• Algorithms and bounds for very strong rainbow coloring

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)