Results 1 to 10 of about 1,445 (260)
Rainbow edge-coloring and rainbow domination
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Douglas West
exaly +2 more sources
Rainbow connections of bioriented graphs [PDF]
HeliyonFor a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected.
Linlin Wang, Sujuan Liu, Han Jiang
doaj +2 more sources
On the Fine-Grained Complexity of Rainbow Coloring [PDF]
SIAM Journal on Discrete Mathematics, 2018 The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that for any $k\ge 2$, there is no algorithm for Rainbow k-Coloring running in time $2^{o(n^{3/2})}$, unless ETH fails.
Juho Lauri, Łukasz Kowalik
exaly +8 more sources
On rainbow total-coloring of a graph
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuefang Sun
exaly +2 more sources
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +2 more sources
Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
MathematicsAn edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color.
Fuhsing Wang
exaly +3 more sources
Barekeng, 2023 Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow
R Adawiyah +4 more
doaj +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Rainbow degree-jump coloring of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2021 In this paper, we introduce a new notion called the rainbow degree-jump coloring of a graph. For a vertex $v\in V(G)$, let the degree-jump closed neighbourhood of a vertex $v$ be defined as $N_{deg}[v] = \{u:d(v,u)\leq d(v)\}.$ A proper coloring of a ...
E.G. Mphako-Banda, J. Kok, S. Naduvath
doaj +1 more source
On the Complexity of Rainbow Coloring Problems [PDF]
Discrete Applied Mathematics, 2016 An edge-colored graph $G$ is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by $rc(G)$, is the minimum number of colors needed to make $G$ rainbow connected.
Eduard Eiben, Robert Ganian, Juho Lauri
openaire +3 more sources