Spanning trees with bounded degrees
From MaRDI portal
Publication:1180410
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)
05C05: Trees
05C35: Extremal problems in graph theory
05C40: Connectivity
05C45: Eulerian and Hamiltonian graphs
Related Items
Small degree out‐branchings, Spanning k-tree with specified vertices, On the largest tree of given maximum degree in a connected graph, Chvátal–Erdős Theorem: Old Theorem with New Aspects, Spanning trees with bounded degrees and leaves, 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, \(m\)-dominating \(k\)-trees of graphs, A note on matchings and spanning trees with bounded degrees, Independence number and \(k\)-trees of graphs, An extension of the Win theorem: counting the number of maximum independent sets, Number of vertices of degree three in spanning 3-trees in square graphs, On a spanning \(k\)-tree in which specified vertices have degree less than \(k\), On spanning trees with few branch vertices, An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets, Neighborhood unions and extremal spanning trees, The independence number condition for the existence of a spanning f-tree
Cites Work
