NP-completeness and degree restricted spanning trees (Q1199472)
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: NP-completeness and degree restricted spanning trees |
scientific article; zbMATH DE number 94345
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness and degree restricted spanning trees |
scientific article; zbMATH DE number 94345 |
Statements
NP-completeness and degree restricted spanning trees (English)
0 references
16 January 1993
0 references
The author proves among other results that the problem of deciding whether a given planar graph with maximum degree 3 has a spanning tree with node degrees 1 or 3 is NP-complete. The proof is based on a polynomial transformation from the Hamiltonian Path Variant Problem using a local replacement argument. As a corollary the author shows that it is NP-complete to decide if there is a spanning tree for such a graph with at least \(n/2+1\) leaves.
0 references
NP-completeness
0 references
planar graph
0 references
spanning tree
0 references
