Tough enough chordal graphs are Hamiltonian

Guantao Chen; Michael S. Jacobson; Andr� E. K�zdy; Jen Lehel

doi:10.1002/(sici)1097-0037(199801)31:1<29::aid-net4>3.0.co;2-m

ScienceGate Book Chapters

JOURNAL ARTICLE

Tough enough chordal graphs are Hamiltonian

Guantao Chen Michael S. Jacobson Andr� E. K�zdy Jen Lehel

Year: 1998 Journal: Networks Vol: 31 (1)Pages: 29-38 Publisher: Wiley

DOI: 10.1002/(sici)1097-0037(199801)31:1<29::aid-net4>3.0.co;2-m

Get Full-Text PDF Get Analytical Report

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

Cited By

1.41

FWCI (Field Weighted Citation Impact)

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

Tough enough chordal graphs are Hamiltonian

Metrics

Citation History

Topics

Related Documents

10-tough chordal graphs are hamiltonian (Extended Abstract)

More than one tough chordal planar graphs are Hamiltonian

More than one tough chordal planar graphs are Hamiltonian

Hamiltonian circuits in chordal bipartite graphs

Tough graphs and hamiltonian circuits