Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. NP-completeness of the Hamiltonian cycle problem for bipartite graphs;Akiyama;J. Inf. Process.,1980
2. A note on Hamiltonian circulant digraphs of outdegree three;Andruchuk;Open J. Discrete Math.,2012
3. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2008
4. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms;Booth;J. Comput. Syst. Sci.,1976
5. The consecutive-4 digraphs are Hamiltonian;Chang;J. Graph Theory,1999