JOURNAL ARTICLE

Non-hamiltonian 54-tough maximal planar graphs

Jochen HarantP.J. Owens

Year: 1995 Journal:   Discrete Mathematics Vol: 147 (1-3)Pages: 301-305   Publisher: Elsevier BV
Keywords:
Mathematics Combinatorics Planar graph Planar Discrete mathematics Exponent Hamiltonian (control theory) Toughness Graph

Metrics

13
Cited By
1.01
FWCI (Field Weighted Citation Impact)
6
Refs
0.73
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

Related Documents

JOURNAL ARTICLE

On k-path hamiltonian maximal planar graphs

İlker Baybars

Journal:   Discrete Mathematics Year: 1982 Vol: 40 (1)Pages: 119-121
BOOK-CHAPTER

Non-Hamiltonian Simple Planar Graphs

Joseph Zaks

North-Holland mathematics studies Year: 1982 Pages: 255-263
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

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

On the shortness exponent of 1-tough, maximal planar graphs

Michal Tkáč

Journal:   Discrete Mathematics Year: 1996 Vol: 154 (1-3)Pages: 321-328
© 2026 ScienceGate Book Chapters — All rights reserved.