𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The edge Hamiltonian path problem is NP-complete for bipartite graphs

✍ Scribed by Ten-Hwang Lai; Shu-Shang Wei

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
508 KB
Volume
46
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ JiΕ™Γ­ Fiala πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co