Restricted coloring problems on graphs with few \(P'_4s\) (Q2840684)
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: Restricted coloring problems on graphs with few P'_4s |
scientific article; zbMATH DE number 6190219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restricted coloring problems on graphs with few \(P'_4s\) |
scientific article; zbMATH DE number 6190219 |
Statements
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
Restricted coloring problems on graphs with few \(P'_4s\) (English)
0 references
0.9522202014923096
0 references
0.8524696230888367
0 references
0.831091046333313
0 references
0.83097904920578
0 references
0.8230817914009094
0 references
