Hamiltonian circuits in chordal bipartite graphs

68Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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 of the HAMILTONIAN PATH problem coincides with the complexity of HAMILTONIAN CIRCUIT. Further, we show that HAMILTONIAN CIRCUIT is linear-time solvable for convex bipartite graphs.

Cite

CITATION STYLE

APA

Müller, H. (1996). Hamiltonian circuits in chordal bipartite graphs. Discrete Mathematics, 156(1–3), 291–298. https://doi.org/10.1016/0012-365X(95)00057-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free