Document

# On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs

## File

LIPIcs.ISAAC.2022.43.pdf
• Filesize: 0.92 MB
• 13 pages

## Cite As

Jakob Dyrseth and Paloma T. Lima. On the Complexity of Rainbow Vertex Colouring Diametral Path Graphs. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 43:1-43:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ISAAC.2022.43

## Abstract

Given a graph and a colouring of its vertices, a rainbow vertex path is a path between two vertices such that all the internal nodes of the path are coloured distinctly. A graph is rainbow vertex-connected if between every pair of vertices in the graph there exists a rainbow vertex path. We study the problem of deciding whether a given graph can be coloured using k or less colours such that it is rainbow vertex-connected. Note that every graph G needs at least diam(G)-1 colours to be rainbow vertex connected. Heggernes et al. [MFCS, 2018] conjectured that if G is a graph in which every induced subgraph has a dominating diametral path, then G can always be rainbow vertex coloured with diam(G)-1 many colours. In this work, we confirm their conjecture for chordal, bipartite and claw-free diametral path graphs. We complement these results by showing the conjecture does not hold if the condition on every induced subgraph is dropped. In fact we show that, in this case, even though diam(G) many colours are always enough, it is NP-complete to determine whether a graph with a dominating diametral path of length three can be rainbow vertex coloured with two colours.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Design and analysis of algorithms
• Mathematics of computing → Graph algorithms
##### Keywords
• rainbow vertex colouring
• diametral path graphs
• interval graphs

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. J. A. Bondy and U.S.R. Murty. Graph Theory. Springer, 2008.
2. Gary Chartrand, Garry L Johns, Kathleen A McKeon, and Ping Zhang. Rainbow connection in graphs. Mathematica bohemica, 133(1):85-98, 2008.
3. Jitender S Deogun and Dieter Kratsch. Diametral path graphs. In International Workshop on Graph-Theoretic Concepts in Computer Science, pages 344-357. Springer, 1995.
4. Paul Dorbec, Ingo Schiermeyer, Elżbieta Sidorowicz, and Éric Sopena. Rainbow connection in oriented graphs. Discrete Applied Mathematics, 179:69-78, 2014.
5. Eduard Eiben, Robert Ganian, and Juho Lauri. On the complexity of rainbow coloring problems. Discrete Applied Mathematics, 246:38-48, 2018.
6. Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T Lima, and Erik Jan van Leeuwen. Rainbow vertex coloring bipartite graphs and chordal graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
7. Michael Krivelevich and Raphael Yuster. The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Journal of Graph Theory, 63(3):185-191, 2010.
8. Juho Lauri. Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds. PhD thesis, Tampere University of Technology, 2016.
9. Shasha Li, Xueliang Li, and Yongtang Shi. Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Applied Mathematics and Computation, 258:155-161, 2015.
10. Xueliang Li, Yaping Mao, and Yongtang Shi. The strong rainbow vertex-connection of graphs. arXiv preprint, 2012. URL: http://arxiv.org/abs/1201.1541.
11. Paloma T Lima, Erik Jan van Leeuwen, and Marieke van der Wegen. Algorithms for the rainbow vertex coloring problem on graph classes. Theoretical Computer Science, 887:122-142, 2021.
12. Michael G Reed, Paul F Syverson, and David M Goldschlag. Anonymous connections and onion routing. IEEE Journal on Selected areas in Communications, 16(4):482-494, 1998.
X

Feedback for Dagstuhl Publishing