Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 206,585,952 papers from all fields of science

Search

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

Highly Cited

2012

Highly Cited

2012

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…

Review

2005

Review

2005

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite…

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…

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…

Review

2001

Review

2001

1998

1998

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphsG(Z,D) for various distance…

Highly Cited

1998

Highly Cited

1998

The concepts of (k, d)-coloring and the star chromatic number, studied by Vince, by Bondy and Hell, and by Zhu are shown to…

1997

1997

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star…

Highly Cited

1988

Highly Cited

1988

A generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n, and the colors on…