scientific article; zbMATH DE number 6991644
From MaRDI portal
Publication:4560246
zbMath1401.68253arXiv1405.6893MaRDI QIDQ4560246
Juho Lauri, Melissa S. Keranen
Publication date: 10 December 2018
Full work available at URL: https://arxiv.org/abs/1405.6893
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items (4)
On the complexity of rainbow coloring problems ⋮ An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs ⋮ A survey on rainbow (vertex-)index of graphs ⋮ Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
This page was built for publication:
