Spanning trees in graphs of minimum degree 4 or 5
type: Item
instance of: scholarly article
title: Spanning trees in graphs of minimum degree 4 or 5
zbMATH Open document ID: 0776.05031
DOI: 10.1016/0012-365X(92)90331-9
author: J. Griggs
author: Mingshen Wu
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 89868
zbMATH Keywords: minimum degree
zbMATH Keywords: spanning tree
zbMATH Keywords: bounds
MaRDI profile type: Publication
cites work: Spanning trees with many leaves in cubic graphs
cites work: Spanning Trees with Many Leaves
cites work: Constructing full spanning trees for cubic graphs
full work available at URL: 0012-365x(92)90331-9
OpenAlex ID: W2064084823
Recommended article: Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
Recommended article: The minimum number of spanning trees in regular multigraphs
Recommended article: Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
Recommended article: Q5080912
Recommended article: Spanning trees with minimum weighted degrees
Recommended article: On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
Recommended article: Q5320577
Recommended article: On family of graphs with minimum number of spanning trees
Recommended article: The vertex degrees of minimum spanning trees
description: scientific article; zbMATH DE number 89868