Some new hereditary classes where graph coloring remains NP-hard (Q556851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some new hereditary classes where graph coloring remains NP-hard |
scientific article; zbMATH DE number 2181969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some new hereditary classes where graph coloring remains NP-hard |
scientific article; zbMATH DE number 2181969 |
Statements
Some new hereditary classes where graph coloring remains NP-hard (English)
0 references
23 June 2005
0 references
Line graph
0 references
Induced subgraph
0 references
Partial subgraph
0 references
0 references
0.9138433
0 references
0.91287965
0 references
0.88293386
0 references
0.8789196
0 references
0.87670267
0 references
