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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2017
02419882017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
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… (More)
Is this relevant?
2013
2013
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… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that… (More)
  • table 1
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 induce a star… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 3.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?
2004
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… (More)
  • 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… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of… (More)
Is this relevant?