Toughness and Hamiltonicity of a class of planar graphs
type: Item
instance of: scholarly article
title: Toughness and Hamiltonicity of a class of planar graphs
zbMATH Open document ID: 1048.05053
author: Yanyan Li
published in: Discrete Mathematics
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 2105611
zbMATH Keywords: Hamiltonian cycles
zbMATH Keywords: Planar graph
zbMATH Keywords: Chordal graph
zbMATH Keywords: Toughness
MaRDI profile type: Publication
full work available at URL: j.disc.2003.11.046
OpenAlex ID: W2009937948
cites work: Not every 2-tough graph is Hamiltonian
cites work: Q3866156
cites work: More than one tough chordal planar graphs are Hamiltonian
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q4342632
cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs
cites work: On rigid circuit graphs
cites work: Toughness and the existence ofk-factors
cites work: Shortness exponents of families of graphs
cites work: Toughness and nonhamiltonicity of polyhedral graphs
cites work: A 1-tough nonhamiltonian maximal planar graph
cites work: Q4518404
cites work: On the shortness exponent of 1-tough, maximal planar graphs
cites work: A Theorem on Planar Graphs
DOI: 10.1016/J.DISC.2003.11.046
description: scientific article; zbMATH DE number 2105611