More than one tough chordal planar graphs are Hamiltonian

T. B�hme; Jochen Harant; Michal Tk�

doi:10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.0.co;2-z

ScienceGate Book Chapters

JOURNAL ARTICLE

More than one tough chordal planar graphs are Hamiltonian

T. B�hme Jochen Harant Michal Tk�

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

DOI: 10.1002/(sici)1097-0118(199912)32:4<405::aid-jgt8>3.0.co;2-z

Get Full-Text PDF Get Analytical Report

Keywords:

Chordal graph Combinatorics Mathematics Outerplanar graph Planar graph Planar Hamiltonian path Graph Discrete mathematics Pathwidth Computer science Line graph

Metrics

Cited By

0.91

FWCI (Field Weighted Citation Impact)

Refs

0.76

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

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

More than one tough chordal planar graphs are Hamiltonian

Metrics

Citation History

Topics

Related Documents

More than one tough chordal planar graphs are Hamiltonian

Tough enough chordal graphs are Hamiltonian

10-tough chordal graphs are hamiltonian (Extended Abstract)

Planar Hamiltonian chordal graphs are cycle extendable

Non-hamiltonian 54-tough maximal planar graphs