The edge Hamiltonian path problem is NP-complete for bipartite graphs
type: Item
instance of: scholarly article
title: The edge Hamiltonian path problem is NP-complete for bipartite graphs
zbMATH Open document ID: 0768.68158
DOI: 10.1016/0020-0190(93)90191-B
author: Ten H. Lai
author: Shu-Shang Wei
published in: Information Processing Letters
publication date: 1993-05-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 178053
zbMATH Keywords: edge graph
zbMATH Keywords: computational complexity
zbMATH Keywords: edge Hamiltonian path problem
zbMATH Keywords: NP- complete
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
cites work: The edge Hamiltonian path problem is NP-complete
cites work: Parallel concepts in graph theory
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Use of graph-theoretic models for optimal relational database accesses to perform join
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
full work available at URL: 0020-0190(93)90191-b
OpenAlex ID: W2063001402
description: scientific article; zbMATH DE number 178053