Results 11 to 20 of about 112,754 (257)
Facial Rainbow Coloring of Plane Graphs [PDF]
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 +3 more sources
Hardness of Rainbow Coloring Hypergraphs [PDF]
, 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 +1 more source
Fine-Grained Complexity of Rainbow Coloring and its Variants [PDF]
, 2017 Consider a graph G and an edge-coloring c_R:E(G) \rightarrow [k]. A rainbow path between u,v \in V(G) is a path P from u to v such that for all e,e' \in E(P), where e \neq e' we have c_R(e) \neq c_R(e').
Agrawal, Akanksha
core +1 more source
High Girth Hypergraphs with Unavoidable Monochromatic or Rainbow Edges
Discussiones Mathematicae Graph Theory, 2022 A classical result of Erdős and Hajnal claims that for any integers k, r, g ≥ 2 there is an r-uniform hypergraph of girth at least g with chromatic number at least k.
Axenovich Maria, Karrer Annette
doaj +1 more source
On the Fine-Grained Complexity of Rainbow Coloring [PDF]
, 2016 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.
Lauri, Juho +2 more
core +1 more source
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms [PDF]
, 2019 A k-uniform hypergraph is said to be r-rainbow colorable if there is an r-coloring of its vertices such that every hyperedge intersects all r color classes.
Sandeep, Sai, Guruswami, Venkatesan
core +1 more source
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +1 more source
An updated survey on rainbow connections of graphs - a dynamic survey
Theory and Applications of Graphs, 2017 The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj +1 more source
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
Journal of Applied Mathematics, 2019 A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths.
J. Cervantes-Ojeda +3 more
doaj +1 more source
The Study of Rainbow Coloring of Graphs and Graph Coloring in Streaming.
, 2021 Graph coloring is a well known problem with wide-ranging applications. The vertex and edge coloring problems have been studied in various models of computation.
Upasana, Anannya
core +1 more source