NP-completeness of the edge precoloring extension problem on bipartite graphs

Publikace na Matematicko-fyzikální fakulta |

2003

The edge precoloring extension problem on bipartite graphs was shown to be NP-complete