Polynomial cases for the vertex coloring problem (Q666663): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Add wikidata reference. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-018-0457-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-018-0457-Y / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129805857 / rank | |||
Normal rank | |||
Latest revision as of 17:52, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial cases for the vertex coloring problem |
scientific article |
Statements
Polynomial cases for the vertex coloring problem (English)
0 references
11 March 2019
0 references
graph algorithms
0 references
vertex coloring
0 references
two forbidden induced subgraphs
0 references
\(P_5\)-free graphs
0 references
0 references
0 references
