A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs (Q3070909)
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: A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs |
scientific article; zbMATH DE number 5842474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs |
scientific article; zbMATH DE number 5842474 |
Statements
28 January 2011
0 references
0.8596985340118408
0 references
0.8573104739189148
0 references
0.8393574953079224
0 references
