Hamiltonian cycle is polynomial on cocomparability graphs

Jitender S. Deogun, George Steiner

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Finding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete problems. In this paper we announce polynomial time solutions for these problems on cocomparability graphs. Our approach is based on exploiting the relationship between the Hamiltonian problem in a cocomparability graph G and the bump number problem in a partial order, the comparability graph of which is the complement of G.

Original languageEnglish (US)
Pages (from-to)165-172
Number of pages8
JournalDiscrete Applied Mathematics
Volume39
Issue number2
DOIs
StatePublished - Oct 22 1992

Fingerprint

Hamiltonians
Hamiltonian circuit
Polynomials
Polynomial
Graph in graph theory
Comparability Graph
Hamiltonian path
Partial Order
Computational complexity
Polynomial time
Complement
NP-complete problem

Keywords

  • Hamiltonian cycle
  • Hamiltonian path
  • bump number
  • cocomparability graphs
  • partial order

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Hamiltonian cycle is polynomial on cocomparability graphs. / Deogun, Jitender S.; Steiner, George.

In: Discrete Applied Mathematics, Vol. 39, No. 2, 22.10.1992, p. 165-172.

Research output: Contribution to journalArticle

@article{84edca3f7d9548858528423d6d2dab0d,
title = "Hamiltonian cycle is polynomial on cocomparability graphs",
abstract = "Finding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete problems. In this paper we announce polynomial time solutions for these problems on cocomparability graphs. Our approach is based on exploiting the relationship between the Hamiltonian problem in a cocomparability graph G and the bump number problem in a partial order, the comparability graph of which is the complement of G.",
keywords = "Hamiltonian cycle, Hamiltonian path, bump number, cocomparability graphs, partial order",
author = "Deogun, {Jitender S.} and George Steiner",
year = "1992",
month = "10",
day = "22",
doi = "10.1016/0166-218X(92)90168-A",
language = "English (US)",
volume = "39",
pages = "165--172",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Hamiltonian cycle is polynomial on cocomparability graphs

AU - Deogun, Jitender S.

AU - Steiner, George

PY - 1992/10/22

Y1 - 1992/10/22

N2 - Finding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete problems. In this paper we announce polynomial time solutions for these problems on cocomparability graphs. Our approach is based on exploiting the relationship between the Hamiltonian problem in a cocomparability graph G and the bump number problem in a partial order, the comparability graph of which is the complement of G.

AB - Finding a Hamiltonian path or a Hamiltonian cycle in a general graph are classic NP-complete problems. In this paper we announce polynomial time solutions for these problems on cocomparability graphs. Our approach is based on exploiting the relationship between the Hamiltonian problem in a cocomparability graph G and the bump number problem in a partial order, the comparability graph of which is the complement of G.

KW - Hamiltonian cycle

KW - Hamiltonian path

KW - bump number

KW - cocomparability graphs

KW - partial order

UR - http://www.scopus.com/inward/record.url?scp=38249010520&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249010520&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(92)90168-A

DO - 10.1016/0166-218X(92)90168-A

M3 - Article

AN - SCOPUS:38249010520

VL - 39

SP - 165

EP - 172

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -