Degree bounded spanning trees
type: Item
instance of: scholarly article
title: Degree bounded spanning trees
zbMATH Open document ID: 1221.05050
author: Jun Fujisawa
author: Hajime Matsumura
author: Tomoki Yamashita
published in: Graphs and Combinatorics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5815688
zbMATH Keywords: spanning tree
zbMATH Keywords: degree bounded tree
zbMATH Keywords: degree sum condition
zbMATH Keywords: independence number
zbMATH Keywords: total excess
MaRDI profile type: Publication
full work available at URL: s00373-010-0941-x
OpenAlex ID: W2044691815
cites work: Q3921262
cites work: Q3097395
cites work: On the largest tree of given maximum degree in a connected graph
cites work: A note on Hamiltonian circuits
cites work: Toughness, trees, and walks
cites work: A sufficient condition for a graph to have a \(k\)-tree
cites work: Spanning trees with bounded degrees
cites work: Note on Hamilton Circuits
cites work: Q3139712
cites work: Spanning trees with few leaves
cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
cites work: On a connection between the existence of k-trees and the toughness of a graph
cites work: On degree sum conditions for long cycles and cycles through specified vertices
DOI: 10.1007/S00373-010-0941-X
description: scientific article; zbMATH DE number 5815688