Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2012.05.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2012.05.003 / rank | |||
Normal rank | |||
Latest revision as of 01:32, 10 December 2024
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
