1. Muller, Haiko. 1996. Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics 156 (1–3): 291–298.
2. P. Renjith, N. Sadagopan. 2017. Hamiltonicity in split graphs-a dichotomy. In Conference on Algorithms and Discrete Applied Mathematics, 320–331. New York: Springer.
3. S. Aadhavan, R. Mahendra Kumar, P. Renjith, N. Sadagopan. 2021. Hamiltonicity: Variants and Generalization in $$P_5$$-free Chordal Bipartite Graphs. arXiv preprint arXiv:2107.04798.
4. Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford. 2009. Introduction to Algorithms, 2nd edn. Cambridge: MIT Press.
5. Takanori, Akiyama, Takao Nishizeki, and Nobuji Saito. 1980. NP-completeness of the Hamiltonian cycle problem for bipartite graphs. Journal of Information processing 3: 73–76.