Algorithms and bounds for very strong rainbow coloring

DOI10.1007/978-3-319-77404-6_46OpenAlexW2599097688MaRDI QIDQ2294720

L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen

Publication date: 12 February 2020

Full work available at URL: https://arxiv.org/abs/1703.00236

zbMATH Keywords

graphs of bounded treewidthvery strong rainbow connection number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs ⋮ Template-driven rainbow coloring of proper interval graphs ⋮ Template-driven rainbow coloring of proper interval graphs

This page was built for publication: Algorithms and bounds for very strong rainbow coloring