✦ LIBER ✦

Tough enough chordal graphs are Hamiltonian

✍ Scribed by Chen, Guantao; Jacobson, Michael S.; K�zdy, Andr� E.; Lehel, Jen?

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 152 KB
Volume: 31
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199801)31:1<29::aid-net4>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that every 18-tough chordal graph has a Hamiltonian cycle.

📜 SIMILAR VOLUMES

More than one tough chordal planar graph

More than one tough chordal planar graphs are Hamiltonian

✍ B�hme, Thomas; Harant, Jochen; Tk�?, Michal 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 2 views

We prove the result stated in the title. Furthermore, it is proved that for any > 0, there is a 1-tough chordal planar graph G such that the length of a longest cycle of G is less than |V (G )|.

Graphs whose powers are chordal and grap

Graphs whose powers are chordal and graphs whose powers are interval graphs

✍ Flotow, Carsten 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

The main theorem of this paper gives a forbidden induced subgraph condition on G that is sufficient for chordality of G m . This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for m = 2. We also give a forbidden subgraph condition on G that is suffi