Star Coloring of Subcubic Graphs
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 on 4 vertices is bi-colored. The star chromatic number of G, χs(G), is the minimum number of colors needed to star color G. In this paper, we sh...
Main Authors: | Karthick T., Subramanian C.R. |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2013-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1672 |
Similar Items
-
Interval Incidence Coloring of Subcubic Graphs
by: Małafiejska Anna, et al.
Published: (2017-05-01) -
A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
by: Lily Chen, et al.
Published: (2022-01-01) -
List Star Edge-Coloring of Subcubic Graphs
by: Kerdjoudj Samia, et al.
Published: (2018-11-01) -
The Rainbow Vertex-Connection Number of Star Fan Graphs
by: Ariestha Widyastuty Bustan, et al.
Published: (2018-12-01) -
A Note On Vertex Colorings Of Plane Graphs
by: Fabricia Igor, et al.
Published: (2014-11-01)