The set chromatic number of a graph
| dc.contributor.author | Chartrand, Gary | |
| dc.contributor.author | Okamoto, Futaba | |
| dc.contributor.author | Rasmussen, Craig W. | |
| dc.contributor.author | Zhang, Ping | |
| dc.date | 2009 | |
| dc.date.accessioned | 2018-02-13T21:31:50Z | |
| dc.date.available | 2018-02-13T21:31:50Z | |
| dc.date.issued | 2009 | |
| dc.identifier.citation | Chartrand, G., Okamoto, F., Rasmussen, C.W. & Zhang, P. 2009, "The set chromatic number of a graph", Discussiones Mathematicae Graph Theory, vol. 29, pp. 545-561. | en_US |
| dc.identifier.uri | https://hdl.handle.net/10945/56997 | |
| dc.description.abstract | For a nontrivial connected graph G, let c : V (G) → ℕ be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χ(s)(G) of G. The set chromatic numbers of some well-known classes of graphs are determined and several bounds are established for the set chromatic number of a graph in terms of other graphical parameters. | |
| dc.format.extent | 18 p. | |
| dc.language.iso | en_US | |
| dc.rights | This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States. | en_US |
| dc.title | The set chromatic number of a graph | en_US |
| dc.type | Article | en_US |
| dc.contributor.corporate | Naval Postgraduate School (U.S.) | |
| dc.contributor.department | Applied Mathematics | en_US |
| dc.subject.author | neighbor-distinguishing coloring | |
| dc.subject.author | set coloring | |
| dc.subject.author | neighborhood color set |
Files in this item
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.
-
Set vertex colorings and joins of graphs
(2009);For a nontrivial connected graph G, let c : V (G) → ℕ be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors ... -
Stratified domination in oriented graphs
(2007);An oriented graph is 2-stratified if its vertex set is partitioned into two classes, where the vertices in one class are colored red and those in the other class are colored blue. Let H be a 2-stratified oriented graph ... -
On stratification and domination in graphs
(2006);A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class), where the vertices in one class are colored red and those in the other class are colored blue. Let ...
