Graphs with 4-rainbow index 3 and n-1

Abstract

Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, 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-tree. The minimum number of colors that are needed in an edge… (More)
DOI: 10.7151/dmgt.1794

Topics

  • Presentations referencing similar topics