On the Complexity of Covering Vertices by Faces in a Planar Graph (Q3790663)
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: On the Complexity of Covering Vertices by Faces in a Planar Graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Covering Vertices by Faces in a Planar Graph |
scientific article |
Statements
On the Complexity of Covering Vertices by Faces in a Planar Graph (English)
0 references
1988
0 references
complexity
0 references
planar graph
0 references
embedding
0 references
polynomial-time recognition algorithm
0 references
Steiner tree
0 references
