Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number |
scientific article |
Statements
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (English)
0 references
26 October 2012
0 references
2-hued chromatic number
0 references
2-hued coloring
0 references
independence number
0 references
probabilistic method
0 references
