JOURNAL ARTICLE

Tough enough chordal graphs are Hamiltonian

Keywords:
Chordal graph Combinatorics Hamiltonian path Mathematics Hamiltonian (control theory) Indifference graph Hamiltonian path problem Computer science Treewidth Graph Pathwidth Mathematical optimization Line graph

Metrics

34
Cited By
1.41
FWCI (Field Weighted Citation Impact)
0
Refs
0.81
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

JOURNAL ARTICLE

10-tough chordal graphs are hamiltonian (Extended Abstract)

Adam KabelaTomáš Kaiser

Journal:   Electronic Notes in Discrete Mathematics Year: 2015 Vol: 49 Pages: 331-336
JOURNAL ARTICLE

More than one tough chordal planar graphs are Hamiltonian

T. B�hmeJochen HarantMichal Tk�

Journal:   Journal of Graph Theory Year: 1999 Vol: 32 (4)Pages: 405-410
JOURNAL ARTICLE

More than one tough chordal planar graphs are Hamiltonian

Thomas BöhmeJochen HarantMichal Tkáč

Journal:   Journal of Graph Theory Year: 1999 Vol: 32 (4)Pages: 405-410
JOURNAL ARTICLE

Hamiltonian circuits in chordal bipartite graphs

Haiko Müller

Journal:   Discrete Mathematics Year: 1996 Vol: 156 (1-3)Pages: 291-298
JOURNAL ARTICLE

Tough graphs and hamiltonian circuits

Vašek Chvátal

Journal:   Discrete Mathematics Year: 2006 Vol: 306 (10-11)Pages: 910-917
© 2026 ScienceGate Book Chapters — All rights reserved.