Spanning trees with bounded degrees

DOI10.1007/BF01375473zbMath0763.05030MaRDI QIDQ1180410

Eduardo Rivera-Campo, Víctor Neumann-Lara

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

independence number; spanning tree; bounded degree

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

Related Items

Small degree out‐branchings, On the largest tree of given maximum degree in a connected graph, Chvátal–Erdős Theorem: Old Theorem with New Aspects, Sufficient condition for the existence of an even \([a,b\)-factor in graph], Spanning \(k\)-ended trees of bipartite graphs, Spanning \(k\)-trees of bipartite graphs, A \(k\)-tree containing specified vertices, Degree bounded spanning trees, Spanning trees: A survey, Spanning \(k\)-trees of \(n\)-connected graphs, Spanning trees with a bounded number of branch vertices in a claw-free graph, Closure and spanning \(k\)-trees, On a \(k\)-tree containing specified leaves in a graph, A note on matchings and spanning trees with bounded degrees, On a spanning \(k\)-tree in which specified vertices have degree less than \(k\), Neighborhood unions and extremal spanning trees, The independence number condition for the existence of a spanning f-tree

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