Hardness Results for Total Rainbow Connection of Graphs

Abstract A total-colored path is total rainbow if both its edges and internal vertices have distinct colors. The total rainbow connection number of a connected graph G, denoted by trc(G), is the smallest number of colors that are needed in a total-coloring of G in order to make G total rainbow connected, that is, any two vertices of G are connected by a total rainbow path. In this paper, we study the computational complexity of total rainbow connection of graphs. We show that deciding whether a given total-coloring of a graph G makes it total rainbow connected is NP-Complete. We also prove that given a graph G, deciding whether trc(G) = 3 is NP-Complete.

[1]  Yongtang Shi,et al.  Note on the Hardness of Rainbow Connections for Planar and Line Graphs , 2015 .

[2]  Yongtang Shi,et al.  On the Rainbow Vertex-Connection , 2013, Discuss. Math. Graph Theory.

[3]  Ingo Schiermeyer.  Rainbow Connection in Graphs with Minimum Degree Three , 2009, IWOCA.

[4]  Garry L. Johns,et al.  Rainbow connection in graphs , 2008 .

[5]  Raphael Yuster,et al.  The rainbow connection of a graph is (at most) reciprocal to its minimum degree , 2010, J. Graph Theory.

[6]  Henry Liu,et al.  Total rainbow k-connection in graphs , 2014, Discret. Appl. Math..

[7]  Xueliang Li,et al.  Rainbow connections for outerplanar graphs with diameter 2 and 3 , 2014, Appl. Math. Comput..

[8]  Xueliang Li,et al.  Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs , 2015, Appl. Math. Comput..

[9]  Dennis Saleh.  Zs , 2001 .

[10]  Xueliang Li,et al.  Rainbow Connection in 3-Connected Graphs , 2013, Graphs Comb..

[11]  Raphael Yuster,et al.  On Rainbow Connection , 2008, Electron. J. Comb..

[12]  Yongtang Shi,et al.  The strong rainbow vertex-connection of graphs , 2012 .

[13]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[14]  Raphael Yuster,et al.  Hardness and Algorithms for Rainbow Connectivity , 2009, STACS.

[15]  Xueliang Li,et al.  Rainbow Connections of Graphs: A Survey , 2011, Graphs Comb..

[16]  Xueliang Li,et al.  The complexity of determining the rainbow vertex-connection of a graph , 2011, Theor. Comput. Sci..

[17]  Raphael Yuster,et al.  Hardness and algorithms for rainbow connection , 2008, J. Comb. Optim..

[18]  Takehiro Ito,et al.  On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms , 2012, Algorithmica.