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.
Highly Cited
2012
Highly Cited
2012
Given a graph G with maximum degree @D>=3, we prove that the acyclic edge chromatic number a^'(G) of G is such that a^'(G)@[email… Expand
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
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
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
2008
2008
A star coloring of a graph is a proper coloring such that no path on four vertices is 2-colored. We prove that every planar graph… Expand
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
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
Highly Cited
2004
Highly Cited
2004
A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star… Expand
  • figure 1
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
1998
1998
This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphsG(Z,D) for various distance… Expand
  • table 1
  • table 2
Highly Cited
1988
Highly Cited
1988
  • A. Vince
  • J. 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