A note on matchings and spanning trees with bounded degrees
type: Item
instance of: scholarly article
title: A note on matchings and spanning trees with bounded degrees
zbMATH Open document ID: 0879.05062
DOI: 10.1007/BF03352993
author: E. Rivera-Campo
published in: Graphs and Combinatorics
publication date: 1997-07-03T00:00:00Z
review text: Let \(G\) be a \(k\)-connected graph with independence number \(\alpha\) and let \(G\) contain a perfect matching. If \(\alpha\leq 1+ {3\over 2}k\), the matching can be extended to a spanning tree of \(G\) with maximum degree at most three.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1029266
zbMATH Keywords: independence number
zbMATH Keywords: perfect matching
zbMATH Keywords: spanning tree
reviewed by: Dietmar Cieslik
MaRDI profile type: Publication
cites work: Q3097395
cites work: A note on Hamiltonian circuits
cites work: Spanning trees with bounded degrees
full work available at URL: https://doi.org/10.1007/bf03352993
OpenAlex ID: W2032442730
Recommended article: Q3767380
Recommended article: A note on spanning trees with a specified degree sequence
Recommended article: On spanning trees with restricted degrees
Recommended article: The number of bounded‐degree spanning trees
Recommended article: Bounded degree spanning trees (extended abstract)
Recommended article: Spanning trees with bounded degrees
Recommended article: Tree spanners of bounded degree graphs
Recommended article: The spanning k-trees, perfect matchings and spectral radius of graphs
Recommended article: Spanning trees of bounded degree
Recommended article: Spanning trees with bounded degrees and leaves
description: scientific article; zbMATH DE number 1029266