Restricted coloring problems on graphs with few \(P_4\)'s (Q490171)
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₄'s |
scientific article; zbMATH DE number 6389146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Restricted coloring problems on graphs with few \(P_4\)'s |
scientific article; zbMATH DE number 6389146 |
Statements
Restricted coloring problems on graphs with few \(P_4\)'s (English)
0 references
22 January 2015
0 references
fixed parameter algorithms
0 references
acyclic coloring
0 references
star coloring
0 references
harmonic coloring
0 references
nonrepetitive coloring
0 references
clique coloring
0 references
Thue chromatic number
0 references
primeval decomposition
0 references
cographs
0 references
\((q,q-4)\)-graphs
0 references
