Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Star coloring

In graph-theoretic mathematics, a star coloring of a graph G is a (proper) vertex coloring in which every path on four vertices uses at least three… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that… Expand
  • table 1
Is this relevant?
2010
2010
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the… Expand
Is this relevant?
2009
2009
A proper coloring of the vertices of a graph is called a st r coloringif the union of every two color classes induce a star… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A proper coloring of the vertices of a graph is called a star coloring if the union of every two color classes induces a star… Expand
Is this relevant?
2009
2009
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Acyclic and star coloring problems are specialized vertex coloring problems that arise in the efficient computation of Hessians… Expand
  • table 2.1
  • figure 3.1
  • figure 4.1
  • table 5.1
  • figure 6.1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
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… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2001
2001
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… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
1993
1993
We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
  • A. Vince
  • Journal of Graph Theory
  • 1988
  • Corpus ID: 11720717
A generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n, and the colors on… Expand
  • figure 1
Is this relevant?