Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (Q5251642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:29, 8 February 2024
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
