The stub resolution of 1-planar graphs
From MaRDI portal
Publication:5084699
DOI10.7155/JGAA.00575zbMATH Open1489.05030OpenAlexW3211913566MaRDI QIDQ5084699FDOQ5084699
Authors:
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.00575
Recommendations
- Bounded stub resolution for some maximal 1-planar graphs
- Drawing Graphs in the Plane with High Resolution
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles
- 1-bend RAC drawings of 1-planar graphs
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Straight-line grid drawings of 3-connected 1-planar graphs
- Fáry's theorem for 1-planar graphs
- Rectilinear drawings of graphs
- 2-layer right angle crossing drawings
- Drawing graphs with right angle crossings
- Drawing planar graphs of bounded degree with few slopes
- Re-embeddings of Maximum 1-Planar Graphs
- Angles of Planar Triangular Graphs
- Graphs that admit right angle crossing drawings
- Title not available (Why is that?)
- Triangulating planar graphs while minimizing the maximum degree
- Drawing trees with perfect angular resolution and polynomial area
- Maximizing the total resolution of graphs
- Vertex angle and crossing angle resolution of leveled tree drawings
- On the Angular Resolution of Planar Graphs
- 1-bend RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- The stub resolution of 1-planar graphs
- Drawing Graphs in the Plane with High Resolution
- The straight-line RAC drawing problem is NP-hard
- Edges and switches, tunnels and bridges
- 1-bend orthogonal partial edge drawing
- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
- Large angle crossing drawings of planar graphs in subquadratic area
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
- Progress on partial edge drawings
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- Universal slope sets for 1-bend planar drawings
- Bounded stub resolution for some maximal 1-planar graphs
- Minimizing the Area for Planar Straight-Line Grid Drawings
- Graphs with large total angular resolution
Cited In (4)
This page was built for publication: The stub resolution of 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084699)