embeddings on non-compact surfaces (the Euclidean plane!) are definitely considered |
m Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4 |
| (3 intermediate revisions by 3 users not shown) | |
(No difference)
| |