Straight-line grid drawings of 3-connected 1-planar graphs
DOI10.1007/978-3-319-03841-4_8zbMATH Open1406.68054OpenAlexW165147621MaRDI QIDQ2867646FDOQ2867646
Authors: Md. Jawaherul Alam, Stephen G. Kobourov, Franz J. Brandenburg 
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_8
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (35)
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- The density of fan-planar graphs
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- Two results on layered pathwidth and linear layouts
- The stub resolution of 1-planar graphs
- An annotated review on graph drawing and its applications
- Recognizing IC-planar and NIC-planar graphs
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Outer 1-planar graphs
- Straight-line drawings of 1-planar graphs
- Title not available (Why is that?)
- A survey on book-embedding of planar graphs
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Characterizing 5-map graphs by 2-fan-crossing graphs
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- On polyhedral graphs and their complements
- Fáry's theorem for 1-planar graphs
- 1-page and 2-page drawings with bounded number of crossings per edge
- Density of straight-line 1-planar graph drawings
- Fan-planarity: properties and complexity
- \(\mathsf{NIC}\)-planar graphs
- An annotated bibliography on 1-planarity
- On partitioning the edges of 1-plane graphs
- Graph product structure for \(h\)-framed graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Characterizing and recognizing 4-map graphs
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- The family of fan-planar graphs
- 1-planarity testing and embedding: an experimental study
- On optimal beyond-planar graphs
- Colored anchored visibility representations in 2D and 3D space
This page was built for publication: Straight-line grid drawings of 3-connected 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867646)
