Results 11 to 20 of about 13,653 (313)
Local Rainbow Colorings for Various Graphs [PDF]
The Electronic Journal of CombinatoricsMotivated by a problem in theoretical computer science suggested by Wigderson, Alon and Ben-Eliezer studied the following extremal problem systematically one decade ago. Given a graph $H$, let $C(n,H)$ be the minimum number $k$ such that the following holds. There are $n$ colorings of $E(K_{n})$ with $k$ colors, each associated with one of the vertices
Xinbu Cheng, Zixiang Xu
openalex +4 more sources
Vertex Colorings without Rainbow Subgraphs
Discussiones Mathematicae Graph Theory, 2016 Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj +2 more sources
Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
Theory and Applications of Graphs, 2017 For positive integers m, n, the greatest number of colors that can appear in an edge coloring of K(m,n) which avoids rainbow cycles is m + n - 1. Here these colorings are constructively characterized.
Peter Johnson, Claire Zhang
doaj +3 more sources
Bounds on coloring trees without rainbow paths [PDF]
Discussiones Mathematicae Graph TheoryWayne Goddard +2 more
doaj +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
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
The (Strong) Rainbow Connection Number of Join Of Ladder and Trivial Graph
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let G = (V,E) be a nontrivial, finite, and connected graph. A function c from E to {1,2,...,k},k ∈ N, can be considered as a rainbow k-coloring if every two vertices x and y in G has an x- y path.
Dinda Kartika +2 more
doaj +1 more source
Rainbow Triangles in Arc-Colored Tournaments [PDF]
Graphs and Combinatorics, 2021 Let $T_{n}$ be an arc-colored tournament of order $n$. The maximum monochromatic indegree $ ^{-mon}(T_{n})$ (resp. outdegree $ ^{+mon}(T_{n})$) of $T_{n}$ is the maximum number of in-arcs (resp. out-arcs) of a same color incident to a vertex of $T_{n}$.
Li, Wei +3 more
openaire +3 more sources
Rainbow connection number of Cm o Pn and Cm o Cn
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a nontrivial connected graph. A rainbow path is a path which is each edge colored with different color. A rainbow coloring is a coloring which any two vertices should be joined by at least one rainbow path.
Alfi Maulani +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