Algorithms for the rainbow vertex coloring problem on graph classes

03/06/2020
by   Paloma T. Lima, et al.
0

Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices. In the Rainbow Vertex Coloring (RVC) problem we want to decide whether the vertices of a given graph can be colored with at most k colors so that the graph becomes rainbow vertex-connected. This problem is known to be NP-complete even in very restricted scenarios, and very few efficient algorithms are known for it. In this work, we give polynomial-time algorithms for RVC on permutation graphs, powers of trees and split strongly chordal graphs. The algorithm for the latter class also works for the strong variant of the problem, where the rainbow vertex paths between each vertex pair must be shortest paths. We complement the latter result by showing that, for any fixed p≥ 3 the problem becomes NP-complete when restricted to split (S_3,...,S_p)-free graphs, where S_q denotes the q-sun graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2018

Conflict-free connections: algorithm and complexity

A path in an(a) edge(vertex)-colored graph is called a conflict-free pat...
research
08/03/2022

On the Computational Complexity of the Strong Geodetic Recognition Problem

A strong geodetic set of a graph G=(V,E) is a vertex set S ⊆ V(G) in whi...
research
10/24/2017

Complexity of locally-injective homomorphisms to tournaments

For oriented graphs G and H, a homomorphism f: G → H is locally-injectiv...
research
10/29/2018

On the End-Vertex Problem of Graph Searches

End vertices of graph searches can exhibit strong structural properties ...
research
06/03/2023

Valid path-based graph vertex numbering

A labelling of a graph is an assignment of labels to its vertex or edge ...
research
09/03/2021

Finding Colorful Paths in Temporal Graphs

The problem of finding paths in temporal graphs has been recently consid...
research
10/04/2017

The Parameterized Complexity of Centrality Improvement in Networks

The centrality of a vertex v in a network intuitively captures how impor...

Please sign up or login with your details

Forgot password? Click here to reset