Výsledky vyhledávání

Report

Star Coloring of Tensor Product of Two Graphs

Autor: Choudhary, Harshit Kumar, Kumari, Swati, Reddy, I. Vinod

A star coloring of a graph $G$ is a proper vertex coloring such that no path on four vertices is bicolored. The smallest integer $k$ for which $G$ admits a star coloring with $k$ colors is called the star chromatic number of $G$, denoted as $\chi_s(G

Externí odkaz: http://arxiv.org/abs/2310.04851

Zobrazit plný text záznamu

Report

On Color Critical Graphs of Star Coloring

Autor: Choudhary, Harshit Kumar, Reddy, I. Vinod

A \emph{star coloring} of a graph $G$ is a proper vertex-coloring such that no path on four vertices is $2$-colored. The minimum number of colors required to obtain a star coloring of a graph $G$ is called star chromatic number and it is denoted by $

Externí odkaz: http://arxiv.org/abs/2305.17956

Zobrazit plný text záznamu

Report

On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs

Autor: Bhyravarapu, Sriram, Kumari, Swati, Reddy, I. Vinod

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

Zobrazit plný text záznamu

Report

On Structural Parameterizations of Star Coloring

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

Zobrazit plný text záznamu