Spanning trees with bounded degrees

DOI10.1007/BF01375473zbMath0763.05030OpenAlexW2031299486MaRDI QIDQ1180410

Eduardo Rivera-Campo, Víctor Neumann-Lara

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

independence numberspanning treebounded degree

Mathematics Subject Classification ID

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

Related Items (28)

Spanning trees with bounded degrees and leaves ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ Small degree out‐branchings ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ A note on a spanning 3-tree ⋮ A note on matchings and spanning trees with bounded degrees ⋮ On a \(k\)-tree containing specified leaves in a graph ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ A \(k\)-tree containing specified vertices ⋮ Degree bounded spanning trees ⋮ Spanning \(k\)-ended trees of bipartite graphs ⋮ Independence number and \(k\)-trees of graphs ⋮ \(m\)-dominating \(k\)-trees of graphs ⋮ Neighborhood unions and extremal spanning trees ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ Spanning \(k\)-trees of bipartite graphs ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) ⋮ Number of vertices of degree three in spanning 3-trees in square graphs ⋮ On spanning trees with few branch vertices ⋮ Spanning k-tree with specified vertices ⋮ On the largest tree of given maximum degree in a connected graph ⋮ The independence number condition for the existence of a spanning f-tree ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Closure and spanning \(k\)-trees ⋮ An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets

Cites Work

• On k-leaf-connected graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A note on Hamiltonian circuits

This page was built for publication: Spanning trees with bounded degrees