Minimal \(2\)-connected non-Hamiltonian claw-free graphs
type: Item
instance of: scholarly article
title: Minimal \(2\)-connected non-Hamiltonian claw-free graphs
zbMATH Open document ID: 0958.05086
DOI: 10.1016/S0012-365X(98)00093-4
author: Jan Brousek
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 1524991
zbMATH Keywords: 2-connected non-Hamiltonian claw-free graphs
zbMATH Keywords: forbidden subgraph conditions
MaRDI profile type: Publication
cites work: Q5422499
cites work: Q3211339
cites work: Q3918148
cites work: Q4862340
cites work: Q4940082
cites work: A strengthening of Ben Rebea's lemma
full work available at URL: s0012-365x(98)00093-4
OpenAlex ID: W1995322874
Recommended article: On Hamiltonicity of 2-connected claw-free graphs
Recommended article: Hamiltonicity in \(2\)-connected claw-free graphs
Recommended article: Hamiltonicity of 2-connected quasi-claw-free graphs
Recommended article: Hamiltonian claw-free graphs involving minimum degrees
Recommended article: Hamiltonian connected claw-free graphs
Recommended article: Hamiltonian connectedness in claw-free graphs
Recommended article: Hamiltonian cycles in \(2\)-connected claw-free graphs
Recommended article: HamiltonianN2-locally connected claw-free graphs
Recommended article: Hamilton‐connected {claw,net}‐free graphs, II
description: scientific article; zbMATH DE number 1524991