Abstract
A convex bipartite graph G with bipartition (X, Y) and an ordering \(X=(x_1,\ldots ,x_n)\) is a bipartite graph such that for each \(y \in Y\), the neighborhood of y in X appears consecutively. G is said to have convexity with respect to X. In this paper, we present a necessary and sufficient condition for the existence of a Hamiltonian cycle in convex bipartite graphs, and further, we obtain a linear-time algorithm for this graph class. We also show that Chvatal’s necessary condition is sufficient for convex bipartite graphs. The closely related problem is HAMILTONIAN PATH whose complexity is open in convex bipartite graphs. We classify the class of convex bipartite graphs as monotone and non-monotone graphs. For monotone convex bipartite graphs, we present a linear-time algorithm to output a Hamiltonian path. It is important to highlight that: (a) in Keil (Inf Process Lett 20:201–206, 1985) and Ghosh (in: WALCOM 2011, LNCS 6552, pp. 191–201, 2011), it is incorrectly claimed that Hamiltonian path problem in convex bipartite graphs is polynomial-time solvable by referring to Muller (Discrete Math 156:291–298, 1996) which actually discusses Hamiltonian cycle and (b) the algorithm appeared in Ghosh (2011) for the longest path problem (Hamiltonian path problem) in biconvex and convex bipartite graphs has an error and it does not compute an optimum solution always. We present an infinite set of counterexamples in support of our claim.
Similar content being viewed by others
References
Mark Keil, J.: Finding Hamiltonian circuits in interval graphs. Inf. Process. Lett. 20, 201–206 (1985)
Ghosh, E., Narayanaswamy, N.S., Rangan, C.P..: A polynomial-time algorithm for longest paths in biconvex graphs. In: WALCOM 2011, LNCS 6552, pp. 191–201 (2011)
Muller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math. 156, 291–298 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2000)
Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem is polynomial on interval graphs. IN: MFCS 2009, LNCS 5734, pp. 403–414 (2009)
Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Int. J. Found. Comput. Sci. 18(5), 911–930 (2007)
Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2), 71–77 (2007)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)
Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math. 16, 539–548 (1964)
Acknowledgements
The authors wish to appreciate and thank N Narayanan (IIT Madras), C Venkata Praveena (IIITDM Kancheepuram) and P Renjith (IIIT Kottayam) for sharing their insights into this problem.
Funding
This work is partially supported by DST-ECRA Project— ECR/2017/001442.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kowsika, P., Divya, V. & Sadagopan, N. Hamiltonicity in convex bipartite graphs. Int J Adv Eng Sci Appl Math 11, 40–52 (2019). https://doi.org/10.1007/s12572-018-00243-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12572-018-00243-0