Claw-free and \(N(2,1,0)\)-free graphs are almost net-free
type: Item
instance of: scholarly article
title: Claw-free and \(N(2,1,0)\)-free graphs are almost net-free
zbMATH Open document ID: 1327.05288
author: Michitaka Furuya
author: Shoichi Tsuchiya
published in: Graphs and Combinatorics
publication date: 2015-12-17T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6521773
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: claw-free graph
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
full work available at URL: s00373-014-1506-1
OpenAlex ID: W2781478604
cites work: Hamiltonicity in claw-free graphs
cites work: Q3577833
cites work: Q3918148
cites work: Characterizing forbidden pairs for hamiltonian properties
DOI: 10.1007/S00373-014-1506-1
description: scientific article; zbMATH DE number 6521773