Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (Q5251642)
From MaRDI portal
scientific article; zbMATH DE number 6437936
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs |
scientific article; zbMATH DE number 6437936 |
Statements
Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (English)
0 references
20 May 2015
0 references
