Results 31 to 40 of about 96,099 (217)
Barekeng, 2023 Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by .
Nisky Imansyah Yahya +3 more
doaj +1 more source
Hardness and Algorithms for Rainbow Connectivity [PDF]
, 2009 An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G
Chakraborty, Sourav +3 more
core +4 more sources
On finding rainbow and colorful paths
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lukasz Kowalik, Juho Lauri
openaire +1 more source
Gallai–Ramsey Numbers Involving a Rainbow 4-Path
Graphs and Combinatorics, 2023 Given two non-empty graphs $G,H$ and a positive integer $k$, the Gallai-Ramsey number $\operatorname{gr}_k(G:H)$ is defined as the minimum integer $N$ such that for all $n\geq N$, every $k$-edge-coloring of $K_n$ contains either a rainbow colored copy of $G$ or a monochromatic copy of $H$.
Jinyu Zou +3 more
openaire +3 more sources
Rainbow cycles vs. rainbow paths
, 2020 An edge-colored graph $F$ is {\it rainbow} if each edge of $F$ has a unique color. The {\it rainbow Turán number} $\mathrm{ex}^*(n,F)$ of a graph $F$ is the maximum possible number of edges in a properly edge-colored $n$-vertex graph with no rainbow copy of $F$.
Halfpap, Anastasia, Palmer, Cory
openaire +2 more sources
Desimal, 2021 A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G ...
Afifah Farhanah Akadji +3 more
doaj +1 more source
Total Rainbow Connection Number of Some Graph Operations
Axioms, 2022 In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H), there is
Hengzhe Li, Yingbin Ma, Yan Zhao
doaj +1 more source
CoRR, 2012 In a properly edge colored graph, a subgraph using every color at most once is called rainbow. In this thesis, we study rainbow cycles and paths in proper edge colorings of complete graphs, and we prove that in every proper edge coloring of K_n, there is a rainbow path on (3/4-o(1))n vertices, improving on the previously best bound of (2n+1)/3 from ...
Heidi Gebauer, Frank Mousset
openaire +2 more sources
A Numerical Approach to Coulomb Gauge QCD [PDF]
, 2008 We calculate the ghost two-point function in Coulomb gauge QCD with a simple model vacuum gluon wavefunction using Monte Carlo integration. This approach extends the previous analytic studies of the ghost propagator with this ansatz, where a ladder ...
A. Cucchieri +7 more
core +2 more sources
Rainbow Path and Color Degree in Edge Colored Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 Let $G$ be an edge colored graph. A rainbow pathin $G$ is a path in which all the edges are colored with distinct colors. Let $d^c(v)$ be the color degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on the edges incident on the vertex $v$. Let $t$ be the maximum length of a rainbow path in $G$.
Anita Das 0001 +2 more
openaire +3 more sources