Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (Q5251642): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2264406464 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1407.1480 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:33, 20 April 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
