Relations between the lower domination parameters and the chromatic number of a graph. (Q1421509)
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: Relations between the lower domination parameters and the chromatic number of a graph. |
scientific article; zbMATH DE number 2032849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relations between the lower domination parameters and the chromatic number of a graph. |
scientific article; zbMATH DE number 2032849 |
Statements
Relations between the lower domination parameters and the chromatic number of a graph. (English)
0 references
26 January 2004
0 references
The authors establish some new polynomial-time computable upper bounds on \(\mu+\chi\) and \(\mu\chi\), where \(\chi\) is the chromatic number and \(\mu\) is one of the following domination parameters: \(\gamma\), \(i\), \(ir\). The bounds are sharp and the corresponding extremal graphs are characterized.
0 references
