A note on matchings and spanning trees with bounded degrees (Q1359373)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on matchings and spanning trees with bounded degrees |
scientific article; zbMATH DE number 1029266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on matchings and spanning trees with bounded degrees |
scientific article; zbMATH DE number 1029266 |
Statements
A note on matchings and spanning trees with bounded degrees (English)
0 references
3 July 1997
0 references
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.
0 references
independence number
0 references
perfect matching
0 references
spanning tree
0 references
0.91166234
0 references
0.91150254
0 references
0.91123635
0 references
0.91096383
0 references
0 references
0 references
0.90547794
0 references
0 references
0.9041451
0 references
