Algorithms for graphs embeddable with few crossings per edge (Q2461632)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for graphs embeddable with few crossings per edge |
scientific article |
Statements
Algorithms for graphs embeddable with few crossings per edge (English)
0 references
28 November 2007
0 references
