Restricted coloring problems on graphs with few (Q2840684): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted coloring problems on graphs with few |
scientific article |
Statements
Restricted coloring problems on graphs with few (English)
0 references
23 July 2013
0 references
acyclic chromatic number
0 references
star chromatic number
0 references
harmonious chromatic number
0 references
greedy colorings
0 references
\((q
0 references
q
0 references
4q
0 references
4)\)-graphs
0 references
\(P_{4}\)-tidy graphs
0 references
polynomial time algorithms
0 references
