Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 13:27, 5 June 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
