Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Bhyravarapu, Sriram"'
For a positive integer $k$, a proper $k$-coloring of a graph $G$ is a mapping $f: V(G) \rightarrow \{1,2, \ldots, k\}$ such that $f(u) \neq f(v)$ for each edge $uv$ of $G$. The smallest integer $k$ for which there is a proper $k$-coloring of $G$ is c
Externí odkaz:
http://arxiv.org/abs/2305.17536
A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open neighborhood. For a graph $G$, the smallest number of colors required f
Externí odkaz:
http://arxiv.org/abs/2305.02570
Given an undirected graph $G=(V,E)$ and an integer $\ell$, the Eccentricity Shortest Path (ESP) asks to find a shortest path $P$ such that for every vertex $v\in V(G)$, there is a vertex $w\in P$ such that $d_G(v,w)\leq \ell$, where $d_G(v,w)$ repres
Externí odkaz:
http://arxiv.org/abs/2304.03233
Autor:
Bhyravarapu, Sriram, Reddy, I. Vinod
A Star Coloring of a graph G is a proper vertex coloring such that every path on four vertices uses at least three distinct colors. The minimum number of colors required for such a star coloring of G is called star chromatic number, denoted by \chi_s
Externí odkaz:
http://arxiv.org/abs/2211.12226
Publikováno v:
In Discrete Applied Mathematics 15 December 2024 358:429-447
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFON (CFCN) coloring, of a graph $G$ using $r$ colors is a coloring of the vertices of $G$ such that every vertex sees some color exactly once in its open (closed) neighborhood. The
Externí odkaz:
http://arxiv.org/abs/2112.12173
Autor:
Bhyravarapu, Sriram, Hartmann, Tim A., Hoang, Hung P., Kalyanasundaram, Subrahmanyam, Reddy, I. Vinod
A conflict-free coloring of a graph $G$ is a (partial) coloring of its vertices such that every vertex $u$ has a neighbor whose assigned color is unique in the neighborhood of $u$. There are two variants of this coloring, one defined using the open n
Externí odkaz:
http://arxiv.org/abs/2105.08693
Given an undirected graph $G = (V,E)$, a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors requir
Externí odkaz:
http://arxiv.org/abs/2010.00063
Given a graph, the conflict-free coloring problem on open neighborhoods (CFON) asks to color the vertices of the graph so that all the vertices have a uniquely colored vertex in its open neighborhood. The smallest number of colors required for such a
Externí odkaz:
http://arxiv.org/abs/2009.06720
In an undirected graph $G$, a conflict-free coloring with respect to open neighborhoods (denoted by CFON coloring) is an assignment of colors to the vertices such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum n
Externí odkaz:
http://arxiv.org/abs/2007.05585