Results 11 to 20 of about 2,084 (327)
On the complexity of rainbow coloring problems [PDF]
Discrete Applied Mathematics, 2018 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 ...
Eduard Eiben +2 more
exaly +5 more sources
Hardness of Rainbow Coloring Hypergraphs [PDF]
Electron. Colloquium Comput. Complex., 2018 A hypergraph is k-rainbow colorable if there exists a vertex coloring using k colors such that each hyperedge has all the k colors. Unlike usual hypergraph coloring, rainbow coloring becomes harder as the number of colors increases. This work studies the
Saket, Rishi, Guruswami, Venkatesan
core +6 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.
Łukasz Kowalik, Juho Lauri
exaly +10 more sources
Strong Rainbow Edge Coloring of Some Interconnection Networks
Procedia Computer Science, 2015 A rainbow edge coloring of a connected graph is a coloring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are colored the same.
Arputhamary, I. Annammal +1 more
exaly +2 more sources
Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-coloring of G is a rainbow disconnection coloring if for every two distinct vertices u and v of G, there ...
Chartrand Gary +4 more
doaj +3 more sources
Color code techniques in rainbow connection
Electronic Journal of Graph Theory and Applications, 2018 Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj +2 more sources
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
BarekengThe concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +3 more sources
How a rainbow coloring function can simulate wait-free handshaking [PDF]
, 1994 How to construct shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the means for communication and synchronization between processes in these systems.
Philippas Tsigas +5 more
core +2 more sources
Vertex rainbow colorings of graphs
Discussiones Mathematicae Graph Theory, 2012 In a properly vertex-colored graph G, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P. If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected.
Fujie-Okamoto, Futaba +3 more
core +2 more sources
The Rainbow Connection Number of Origami Graphs and Pizza Graphs
Procedia Computer Science, 2015 Let G = (V(G), E(G)) be a nontrivial, finite, and connected graph. Define a k-coloring c : E(G) → {1, 2, ..., n} for some n ∈ N, where two adjacent edges may have the same color. A path from u to v, denoted by u − v path, is said a u − v rainbow path, if
A N M Salman
exaly +2 more sources