Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Hardness Results for Total Rainbow Connection of Graphs

Lily Chen;  Bofeng Huo;  Yingbin Ma — 2016

Discussiones Mathematicae Graph Theory

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...

The 3-Rainbow Index of a Graph

Lily Chen;  Xueliang Li;  Kang Yang;  Yan Zhao — 2015

Discussiones Mathematicae Graph Theory

Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex subset S ⊆ V (G), a tree that connects S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a rainbow S-tree for each k-subset S of V (G) is called the k-rainbow index of G, denoted by rxk(G). In this paper,...

Page 1

Download Results (CSV)