相关论文: Star coloring splitting graphs of cycles
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…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…
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…
The star chromatic index of a multigraph $G$, denoted $\chi'_{st}(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length four is bicolored. We survey the results of determining…
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…
A proper vertex coloring of a graph $G$ is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored $P_4$ in $G$. In this paper, we show that the Cartesian product…
A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number $\chi_s(G)$ is the smallest number of colors required to obtain a star…
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of $G$, is the smallest integer $k$ for which $G$…
The star chromatic index of a multigraph $G$, denoted by $\chi_{\mathrm{star}}'(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length $4$ is bicolored. In this paper, we study…
The star chromatic index of a graph $G$, denoted by $\chi'_{st}(G) $, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length four is bi-colored. Casselgren et al. and Hou et al.…
A star edge-coloring of a graph $G$ is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star edge-coloring with $k$ colors is the star chromatic index of $G$. In the…
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of a graph $G$, is the smallest integer $k$ for which…
{\emph A star edge-coloring} of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every…
The star chromatic index $\chi_s'(G)$ of a graph $G$ is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi-colored. We obtain a near-linear upper bound in terms of the…
A star coloring of a graph $G$ is a proper coloring where vertices of every two color classes induce a forest of stars. A strict partial order is defined on the set of all star colorings of $G$. We introduce the star b-chromatic number…
A star edge coloring of a graph is a proper edge coloring with no $2$-colored path or cycle of length four. The star chromatic index $\chi'_{st}(G)$ of $G$ is the minimum number $t$ for which $G$ has a star edge coloring with $t$ colors. We…
A \textit{star $k$-coloring} of a graph $G$ is a proper (vertex) $k$-coloring of $G$ such that the vertices on a path of length three receive at least three colors. Given a graph $G$, its \textit{star chromatic number}, denoted $\chi_s(G)$,…
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every path and cycle of length four in $G$ uses at least three different colors. The star chromatic index of a graph $G$, is the smallest integer $k$ for which…
\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for…
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ such that no path or cycle of length four is bi-colored. The star chromatic index of $G$, denoted by $\chi^{\prime}_{s}(G)$, is the minimum $k$ such that $G$ admits a star…