Spanning trees with bounded degrees

DOI10.1007/BF01375473MaRDI QIDQ1180410zbMATH OpenOpenAlexFDO

Authors E. Rivera-Campo, V. 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) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 434863
• Spanning trees of bounded degree
• Degree bounded spanning trees
• Spanning \(k\)-tree with specified vertices

Cites work

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

Cited in

(41)

• Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
• Independence number and \(k\)-trees of graphs
• A note on a spanning 3-tree
• The independence number condition for the existence of a spanning \(f\)-tree
• Spanning trees with bounded degrees and leaves
• Snarks with special spanning trees
• An extension of the Win theorem: counting the number of maximum independent sets
• Spanning \(k\)-ended trees of bipartite graphs
• Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
• Spanning \(k\)-trees of \(n\)-connected graphs
• On spanning trees with few branch vertices
• scientific article; zbMATH DE number 2157456 (Why is no real title available?)
• Characterizing spanning trees via the size or the spectral radius of graphs
• Spanning \(k\)-tree with specified vertices
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Degree-bounded minimum spanning trees
• The spanning k-trees, perfect matchings and spectral radius of graphs
• On a \(k\)-tree containing specified leaves in a graph
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• A note on matchings and spanning trees with bounded degrees
• Closure and spanning \(k\)-trees
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
• Near-optimal bounded-degree spanning trees
• Degree bounded spanning trees
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• A \(k\)-tree containing specified vertices
• \(m\)-dominating \(k\)-trees of graphs
• scientific article; zbMATH DE number 5174840 (Why is no real title available?)
• scientific article; zbMATH DE number 434863 (Why is no real title available?)
• Spanning \(k\)-trees of bipartite graphs
• Small degree out‐branchings
• Neighborhood unions and extremal spanning trees
• Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
• Number of vertices of degree three in spanning 3-trees in square graphs
• On the largest tree of given maximum degree in a connected graph
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Chvátal–Erdős Theorem: Old Theorem with New Aspects
• Spanning trees: A survey
• Spanning trees of bounded degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180410)