On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976)
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: On colouring (2P₂,H)-free and (P₅,H)-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs |
scientific article |
Statements
On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (English)
0 references
4 April 2018
0 references
colouring
0 references
hereditary graph class
0 references
computational complexity
0 references
\((H_1,H_2)\)-free
0 references
paths
0 references
0 references
