NP-completeness and degree restricted spanning trees (Q1199472): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Graphs with homeomorphically irreducible spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90130-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067078311 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness and degree restricted spanning trees |
scientific article |
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
