Strong coloring
In graph theory, a strong coloring is a (proper) vertex coloring in which every vertex is adjacent to some entire color class.
This is an old revision of this page, as edited by Peter Kwok (talk | contribs) at 07:07, 30 May 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
In graph theory, a strong coloring is a (proper) vertex coloring in which every vertex is adjacent to some entire color class.