Dec 9, 2017 · A star coloring of a graph G is a proper coloring of G such that the union of any two color classes induces a star forest, that is, a proper ...
Dec 9, 2017 · We show that some classes of perfect graphs, some classes of (P5, C4)-free graphs, and some classes of K1,3-free graphs are χs-bounded. We also ...
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path ...
Jul 4, 2013 · Abstract:\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four.
Detailed Record ; Title: Star Coloring of Certain Graph Classes. ; Language: English ; Authors: Karthick, T. · karthick@isichennai.res.in ; Source: Graphs & ...
Jul 4, 2013 · 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 ...
The minimum number of colors required to color the graph G satisfying the above conditions for star-in-coloring is called the star-in-chromatic number of and is ...
"Star Coloring of Certain Graph Classes" by T. Karthick
digitalcommons.isical.ac.in › journal-arti...
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path ...
A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color, and (ii) no path ...
Star coloring (2). A star coloring of a graph G is a proper coloring of G such that the union of every two color classes induces a star forest. This notion ...