Graphs with 4-Rainbow Index 3 and n − 1
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 called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree that connects S in G is called an S-tr...
Main Authors: | Li Xueliang, Schiermeyer Ingo, Yang Kang, Zhao Yan |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1794 |
Similar Items
-
Graphs with 3-Rainbow Index n − 1 and n − 2
by: Li Xueliang, et al.
Published: (2015-02-01) -
The 3-Rainbow Index of a Graph
by: Chen Lily, et al.
Published: (2015-02-01) -
The rainbow vertex-index of complementary graphs
by: Fengnan Yanling, et al.
Published: (2015-09-01) -
Rainbow Connection Number of Dense Graphs
by: Li Xueliang, et al.
Published: (2013-07-01) -
Rainbow Connection In Sparse Graphs
by: Kemnitz Arnfried, et al.
Published: (2013-03-01)