Maximal trees with bounded maximum degree in a graph

DOI10.1007/s003730050027zbMath0911.05029OpenAlexW2003562726MaRDI QIDQ1268112

Min Aung, Aung Kyaw

Publication date: 14 October 1998

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

Full work available at URL: https://doi.org/10.1007/s003730050027

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Spanning spiders and light-splitting switches ⋮ Neighborhood unions and extremal spanning trees ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Number of vertices of degree three in spanning 3-trees in square graphs ⋮ Closure and spanning trees with bounded total excess

This page was built for publication: Maximal trees with bounded maximum degree in a graph