Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Ali Dehghan / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Arash Ahadi / rank | |||
Normal rank | |||
Revision as of 19:33, 12 February 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
