Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Face covers and the genus problem for apex graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4263724 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to Draw a Graph / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-6377(02)00119-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112435812 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embeddings of planar graphs that minimize the number of long-face cycles |
scientific article |
Statements
Embeddings of planar graphs that minimize the number of long-face cycles (English)
0 references
2 April 2003
0 references
graph drawing
0 references
planar graph
0 references
computational complexity
0 references
