1. NP-completeness of the Hamiltonian cycle problem for bipartite graphs;Akiyama;J. Information Processing,1980
2. Complexity of finding embeddings in a k-tree;Arnborg,1984
3. Linear time algorithms for NP-hard problems on graphs embedded in k-trees;Arnborg,1984
4. A linear time algorithm for the subgraph homeomorphism problem for the fixed graph K3,3;Asano,1983
5. A polynomial algorithm for the max-cut problem on graphs without sub-graphs homeomorphic to K3,3;Asano,1984