On Star Coloring of Graphs

Authors:
Guillaume Fertin;André Raspaud;Bruce A. Reed
Affiliations:
-;-;-
Venue:
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2001

Citing 3
Cited 5

A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Graph classes: a survey

Graph classes: a survey
A coloring problem on the n-cube

Discrete Applied Mathematics

Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Folding

Journal of Combinatorial Theory Series B
Grad and classes with bounded expansion I. Decompositions

European Journal of Combinatorics
A polyhedral study of the acyclic coloring problem

Discrete Applied Mathematics
Star list chromatic number of planar subcubic graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with the notion of star coloring of graphs. A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored.We give the exact value of the star chromatic number of different families of graphs such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids. We also study and give bounds for the star chromatic number of other families of graphs, such as hypercubes, tori, d-dimensional grids, graphs with bounded treewidth and planar graphs.