On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:08, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
