A graph with cover degeneracy less than chromatic number (Q2746206)
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: A graph with cover degeneracy less than chromatic number |
scientific article; zbMATH DE number 1655620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph with cover degeneracy less than chromatic number |
scientific article; zbMATH DE number 1655620 |
Statements
17 November 2002
0 references
cover degeneracy
0 references
chromatic number
0 references
vertex partition
0 references
forest
0 references
A graph with cover degeneracy less than chromatic number (English)
0 references
An example of a 4-chromatic graph which admits a vertex partition into three parts such that the union of every two of them induces a forest is given. Three related open problems are mentioned, too.
0 references
0.9191380739212036
0 references