Vertex coloring of graphs with few obstructions (Q344868): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6656024 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex coloring | |||
| Property / zbMATH Keywords: vertex coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial-time algorithm | |||
| Property / zbMATH Keywords: polynomial-time algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed-parameter tractability | |||
| Property / zbMATH Keywords: fixed-parameter tractability / rank | |||
Normal rank | |||
Revision as of 08:03, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex coloring of graphs with few obstructions |
scientific article |
Statements
Vertex coloring of graphs with few obstructions (English)
0 references
24 November 2016
0 references
vertex coloring
0 references
polynomial-time algorithm
0 references
fixed-parameter tractability
0 references
