Premium
Tough enough chordal graphs are Hamiltonian
Author(s) -
Chen Guantao,
Jacobson Michael S.,
Kézdy André E.,
Lehel Jenő
Publication year - 1998
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199801)31:1<29::aid-net4>3.0.co;2-m
Subject(s) - chordal graph , combinatorics , hamiltonian path , mathematics , hamiltonian (control theory) , indifference graph , hamiltonian path problem , computer science , treewidth , graph , pathwidth , mathematical optimization , line graph
We prove that every 18‐tough chordal graph has a Hamiltonian cycle. © 1998 John Wiley & Sons, Inc. Networks 31: 29–38, 1998