More than one tough chordal planar graphs are Hamiltonian

Thomas Böhme; Jochen Harant; Michal Tkáč

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

ScienceGate Book Chapters

JOURNAL ARTICLE

More than one tough chordal planar graphs are Hamiltonian

Thomas 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.3.co;2-q

Get Full-Text PDF Get Analytical Report

Abstract

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 cycles of G " is less than "jV (G " )j.

Keywords:

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

Metrics

Cited By

0.46

FWCI (Field Weighted Citation Impact)

Refs

0.60

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

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

More than one tough chordal planar graphs are Hamiltonian

Abstract

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