出典:Wikipedia
出典:『Wikipedia』 (2010/11/09 15:18 UTC 版)
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 distinct colors. Equivalently, in a star coloring, the induced subgraphs formed by the vertices of any two colors has connected components that are star graphs. The star chromatic number χs(G) of G is the least number of colors needed to star color G.