Algorithms for the rainbow vertex coloring problem on graph classes
From MaRDI portal
Publication:820548
DOI10.1016/J.TCS.2021.07.009OpenAlexW3186032444MaRDI QIDQ820548FDOQ820548
Authors: Paloma T. Lima, Erik Jan van Leeuwen, Marieke van der Wegen 
Publication date: 27 September 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03108
Recommendations
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes
- Complexity of rainbow vertex connectivity problems for restricted graph classes
- Rainbow vertex coloring bipartite graphs and chordal graphs
- On the complexity of rainbow coloring problems
- Further hardness results on the rainbow vertex-connection number of graphs
Cites Work
- Modular decomposition and transitive orientation
- Rainbow connections of graphs
- Rainbow connection number and connected dominating sets
- Rainbow connection in graphs
- Title not available (Why is that?)
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The complexity of determining the rainbow vertex-connection of a graph
- The strong rainbow vertex-connection of graphs
- Further hardness results on the rainbow vertex-connection number of graphs
- On the complexity of rainbow coloring problems
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Linear-time algorithms for tree root problems
- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs
- Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes
Cited In (4)
This page was built for publication: Algorithms for the rainbow vertex coloring problem on graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820548)
