✦ LIBER ✦

Finding Hamiltonian circuits in proper interval graphs

✍ Scribed by Alan A. Bertossi

Book ID: 113162581
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 388 KB
Volume: 17
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90078-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding Hamiltonian circuits in interval

Finding Hamiltonian circuits in interval graphs

✍ J.Mark Keil 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Hamiltonian circuits in interval graph g

Hamiltonian circuits in interval graph generalizations

✍ Alan A. Bertossi; Maurizio A. Bonuccelli 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Hamiltonian circuits in Cayley graphs

✍ Dragan Marušič 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Hamiltonian circuits in random graphs

✍ L. Pósa 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Finding large cycles in Hamiltonian grap

Finding large cycles in Hamiltonian graphs

✍ Tomás Feder; Rajeev Motwani 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Hamiltonian circuits in chordal bipartit

Hamiltonian circuits in chordal bipartite graphs

✍ Haiko Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 359 KB

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