Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
type: Item
instance of: scholarly article
title: Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
zbMATH Open document ID: 1117.05062
author: Frank Bullock
author: Marietjie Frick
author: Joy Singleton
published in: Discrete Mathematics
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5146822
zbMATH Keywords: longest path
zbMATH Keywords: detour
zbMATH Keywords: Hamiltonian path
MaRDI profile type: Publication
full work available at URL: j.disc.2005.11.063
OpenAlex ID: W1985124593
cites work: Not every 2-tough graph is Hamiltonian
cites work: Detour-saturated graphs
cites work: On factors of 4-connected claw-free graphs
cites work: Q5708533
cites work: Q3918148
cites work: Hamiltonian results inK1,3-free graphs
cites work: Hamiltonicity in claw-free graphs
cites work: Q3710548
cites work: Graphs maximal with respect to absence of hamiltonian paths
DOI: 10.1016/J.DISC.2005.11.063
description: scientific article; zbMATH DE number 5146822