The Degenerate Crossing Number and Higher-Genus Embeddings
From MaRDI portal
Publication:5084703
DOI10.7155/jgaa.00580zbMath1490.68164OpenAlexW4225716785MaRDI QIDQ5084703
Daniel Štefanković, Marcus Schaefer
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00580
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19--21, 2016. Revised selected papers
- Degenerate crossing numbers
- Removing even crossings on surfaces
- The genus problem for cubic graphs
- Optimally cutting a surface into a disk
- A new technique to compute polygonal schema for 2-manifolds with application to null-homotopy detection
- On the degenerate crossing number
- The graph crossing number and its variants: a survey
- Bounds for generalized thrackles
- Bundled Crossings in Embedded Graphs
- Block Additivity of ℤ2-Embeddings
- The genus crossing number
- Approximation Algorithms for Euler Genus and Related Problems
- Bundled Crossings Revisited
- Polylogarithmic approximation for Euler genus on bounded degree graphs
- Computing a canonical polygonal schema of an orientable triangulated surface
- Planar Drawings of Higher-Genus Graphs