NP completeness of the edge precoloring extension problem on bipartite graphs (Q4406072)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1934643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP completeness of the edge precoloring extension problem on bipartite graphs |
scientific article; zbMATH DE number 1934643 |
Statements
NP completeness of the edge precoloring extension problem on bipartite graphs (English)
0 references
25 June 2003
0 references
graph coloring
0 references
precoloring extension
0 references
computational complexity
0 references
0.8845162987709045
0 references
0.8511579632759094
0 references
