Hamiltonian circuits in simplicial complexes
✍ Scribed by Günter Ewald
- Publisher
- Springer
- Year
- 1973
- Tongue
- English
- Weight
- 469 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The main result of this paper is the NP-completeness of the HAMILTONIAN CIRCUIT problem for chordal bipartite graphs. This is proved by a sophisticated reduction from SATISFIABILITY. As a corollary, HAMILTONIAN CIRCUIT is NP-complete for strongly chordal split graphs. On both classes the complexity
## dedicated to h. lenzing on the occasion of his 60th birthday Let A be a finite dimensional, connected, associative algebra withunit over an algebraically closed field k. All modules we consider are finitely generated, and mod A will denote the category of (finitely generated) A-left-modules. T