The stub resolution of 1-planar graphs

DOI10.7155/JGAA.00575MaRDI QIDQ5084699zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00575

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3885930 (Why is no real title available?)
• 1-bend orthogonal partial edge drawing
• 2-layer right angle crossing drawings
• An annotated bibliography on 1-planarity
• Angles of Planar Triangular Graphs
• Bounded stub resolution for some maximal 1-planar graphs
• Drawing Graphs in the Plane with High Resolution
• Drawing graphs with right angle crossings
• Drawing trees with perfect angular resolution and polynomial area
• Edges and switches, tunnels and bridges
• Fáry's theorem for 1-planar graphs
• Graphs that admit right angle crossing drawings
• Graphs with large total angular resolution
• Large angle crossing drawings of planar graphs in subquadratic area
• Maximizing ink in partial edge drawings of \(k\)-plane graphs
• Maximizing the total resolution of graphs
• Minimizing the Area for Planar Straight-Line Grid Drawings
• On the Angular Resolution of Planar Graphs
• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
• Progress on partial edge drawings
• Re-embeddings of Maximum 1-Planar Graphs
• Rectilinear drawings of graphs
• Straight-line grid drawings of 3-connected 1-planar graphs
• The straight-line RAC drawing problem is NP-hard
• The stub resolution of 1-planar graphs
• Triangulating planar graphs while minimizing the maximum degree
• Universal slope sets for 1-bend planar drawings
• Vertex angle and crossing angle resolution of leveled tree drawings

Cited in

(4)

• Progress on partial edge drawings
• Bounded stub resolution for some maximal 1-planar graphs
• Progress on partial edge drawings
• Graphs with large total angular resolution

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)