Spanning trees with many leaves
type: Item
instance of: scholarly article
title: Spanning trees with many leaves
zbMATH Open document ID: 1402.05113
published in: Journal of Mathematical Sciences (New York)
publication date: 2015-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6406588
MaRDI profile type: MaRDI publication profile
full work available at URL: s10958-011-0613-2
OpenAlex ID: W2019024253
cites work: Constructing full spanning trees for cubic graphs
cites work: Spanning trees in graphs of minimum degree 4 or 5
cites work: Spanning Trees with Many Leaves
cites work: Transversal numbers of uniform hypergraphs
cites work: Q5183516
DOI: 10.1007/S10958-011-0613-2
Recommended article: Spanning Trees with Many Leaves
Recommended article: Spanning trees with many leaves
Recommended article: Spanning Directed Trees with Many Leaves
Recommended article: Constructing a spanning tree with many leaves
Recommended article: Spanning trees with few leaves
Recommended article: Spanning trees with many leaves and average distance
Recommended article: Spanning trees with few non-leaves
Recommended article: Spanning trees with a bounded number of leaves
Recommended article: Spanning Trees with Many Leaves in Regular Bipartite Graphs
Recommended article: Spanning trees with many leaves in cubic graphs
description: scientific article; zbMATH DE number 6406588