More than one tough chordal planar graphs are Hamiltonian

✍ Scribed by B�hme, Thomas; Harant, Jochen; Tk�?, Michal

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 176 KB
• Volume: 32
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.0.co;2-z

✦ Synopsis

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 )|.