Saturated simple and 2-simple topological graphs with few edges
From MaRDI portal
Publication:4600740
DOI10.7155/JGAA.00460zbMATH Open1377.05039OpenAlexW2781856883MaRDI QIDQ4600740FDOQ4600740
Authors: Péter Hajnal, Alexander Igamberdiev, Günter Rote, André Schulz
Publication date: 12 January 2018
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00460
Recommendations
Cited In (9)
- Edge-minimum saturated \(k\)-planar drawings
- Saturated Simple and 2-simple Topological Graphs with Few Edges
- Edge-minimum saturated \(k\)-planar drawings
- Saturated simple and \(k\)-simple topological graphs
- Inserting one edge into a simple drawing is hard
- Quantitative restrictions on crossing patterns
- Improved enumeration of simple topological graphs
- Extending simple drawings
- On the edge-vertex ratio of maximal thrackles
This page was built for publication: Saturated simple and 2-simple topological graphs with few edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600740)