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)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- T. Karthickand, C. R. Subramanian
- 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

- T. Karthick, C. R. Subramanian
- Discussiones Mathematicae Graph Theory
- 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

- AndrÃ© KÃ¼ndgen, Craig Timmons
- Journal of Graph Theory
- 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)

Is this relevant?

2010

2010

- Ken-ichi Kawarabayashi, Bojan Mohar
- SIAM J. Discrete Math.
- 2010

It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and thatâ€¦Â (More)

Is this relevant?

2009

2009

- Yuehua Bu, Daniel W. Cranston, MickaÃ«l Montassier, AndrÃ© Raspaud, Wei-Fan Wang
- Journal of Graph Theory
- 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)

Is this relevant?

2009

2009

- Hal A. Kierstead, AndrÃ© KÃ¼ndgen, Craig Timmons
- Journal of Graph Theory
- 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)

Is this relevant?

2008

2008

- Craig Timmons
- Electr. J. Comb.
- 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)

Is this relevant?

2004

2004

- Guillaume Fertin, AndrÃ© Raspaud, Bruce A. Reed
- Journal of Graph Theory
- 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)

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)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- John Adrian Bondy, Pavol Hell
- Journal of Graph Theory
- 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?