Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:42, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the maximum leaf spanning tree problem on planar and regular graphs |
scientific article |
Statements
Complexity of the maximum leaf spanning tree problem on planar and regular graphs (English)
0 references
31 March 2016
0 references
maximum leaf spanning tree
0 references
NP-hardness
0 references
APX-hardness
0 references
planar graph
0 references
cubic graph
0 references
