1-tough cocomparability graphs are hamiltonian

Jitender S. Deogun, Dieter Kratsch, George Steiner

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

We show that every 1-tough cocomparability graph has a Hamilton cycle. This settles a conjecture of Chvàtal for the case of cocomparability graphs. Our approach is based on exploiting the close relationship of the problem to the scattering number and the path cover number.

Original languageEnglish (US)
Pages (from-to)99-106
Number of pages8
JournalDiscrete Mathematics
Volume170
Issue number1-3
DOIs
StatePublished - Jun 10 1997

Fingerprint

Hamiltonians
Scattering
Hamilton Cycle
Graph in graph theory
Cover
Path
Relationships

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

1-tough cocomparability graphs are hamiltonian. / Deogun, Jitender S.; Kratsch, Dieter; Steiner, George.

In: Discrete Mathematics, Vol. 170, No. 1-3, 10.06.1997, p. 99-106.

Research output: Contribution to journalArticle

Deogun, Jitender S. ; Kratsch, Dieter ; Steiner, George. / 1-tough cocomparability graphs are hamiltonian. In: Discrete Mathematics. 1997 ; Vol. 170, No. 1-3. pp. 99-106.
@article{aa15e9032599442983a6b1cd462c6c87,
title = "1-tough cocomparability graphs are hamiltonian",
abstract = "We show that every 1-tough cocomparability graph has a Hamilton cycle. This settles a conjecture of Chv{\`a}tal for the case of cocomparability graphs. Our approach is based on exploiting the close relationship of the problem to the scattering number and the path cover number.",
author = "Deogun, {Jitender S.} and Dieter Kratsch and George Steiner",
year = "1997",
month = "6",
day = "10",
doi = "10.1016/0012-365X(95)00359-5",
language = "English (US)",
volume = "170",
pages = "99--106",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - 1-tough cocomparability graphs are hamiltonian

AU - Deogun, Jitender S.

AU - Kratsch, Dieter

AU - Steiner, George

PY - 1997/6/10

Y1 - 1997/6/10

N2 - We show that every 1-tough cocomparability graph has a Hamilton cycle. This settles a conjecture of Chvàtal for the case of cocomparability graphs. Our approach is based on exploiting the close relationship of the problem to the scattering number and the path cover number.

AB - We show that every 1-tough cocomparability graph has a Hamilton cycle. This settles a conjecture of Chvàtal for the case of cocomparability graphs. Our approach is based on exploiting the close relationship of the problem to the scattering number and the path cover number.

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

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

U2 - 10.1016/0012-365X(95)00359-5

DO - 10.1016/0012-365X(95)00359-5

M3 - Article

AN - SCOPUS:0038282323

VL - 170

SP - 99

EP - 106

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -