On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs

DOI10.1007/S00373-010-1011-0zbMath1235.05083OpenAlexW2026468970MaRDI QIDQ659687

Roman Kužel, Jakub Teska

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-1011-0

zbMATH Keywords

Hamiltonian cycle2-connected graphtrestle\(K_{1,r}\)-free

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Spanning trees and spanning closed walks with small degrees

Cites Work

• A note on \(k\)-walks in bridgeless graphs
• On k-trestles in polyhedreal graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs