On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
type: Item
instance of: scholarly article
title: On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
zbMATH Open document ID: 1235.05083
author: Roman Kužel
author: Jakub Teska
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5999827
zbMATH Keywords: trestle
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: \(K_{1,r}\)-free
zbMATH Keywords: 2-connected graph
MaRDI profile type: Publication
full work available at URL: s00373-010-1011-0
OpenAlex ID: W2026468970
cites work: Q3097395
cites work: Q4014627
cites work: A note on \(k\)-walks in bridgeless graphs
cites work: On k-trestles in polyhedreal graphs
DOI: 10.1007/S00373-010-1011-0
description: scientific article; zbMATH DE number 5999827