Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs

DOI10.1006/JCTB.1995.1013zbMath0821.05035OpenAlexW2036217110MaRDI QIDQ1892839

Nicholas C. Wormald, Bill Jackson

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1013

zbMATH Keywords

maximum degreespanning subgraphlong cyclesbounded degree\(k\)-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (2)

Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

This page was built for publication: Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs