Untangling planar graphs from a specified vertex position-Hard cases (Q534342): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Mathias Schacht / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C62 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5895540 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial geometry | |||
| Property / zbMATH Keywords: combinatorial geometry / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph drawing | |||
| Property / zbMATH Keywords: graph drawing / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graphs | |||
| Property / zbMATH Keywords: planar graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
untangling problem | |||
| Property / zbMATH Keywords: untangling problem / rank | |||
Normal rank | |||
Revision as of 08:39, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Untangling planar graphs from a specified vertex position-Hard cases |
scientific article |
Statements
Untangling planar graphs from a specified vertex position-Hard cases (English)
0 references
17 May 2011
0 references
combinatorial geometry
0 references
graph drawing
0 references
planar graphs
0 references
untangling problem
0 references
