Re-embedding a 1-plane graph for a straight-line drawing in linear time

DOI10.1016/J.TCS.2021.09.015MaRDI QIDQ2235768zbMATH OpenOpenAlexFDO

Authors Seok-Hee Hong, Hiroshi Nagamochi

Publication date 21 October 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.09.015

zbMATH Keywords

1-planar graphsbeyond planar graphsstraight-line drawing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
• Straight-line drawings of 1-planar graphs
• Straight-line grid drawings of 3-connected 1-planar graphs
• Fáry's theorem for 1-planar graphs
• Re-embeddings of Maximum 1-Planar Graphs

Cites work

• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• A linear-time algorithm for testing outer-1-planarity
• Acyclic colouring of 1-planar graphs
• Algorithms for 1-Planar Graphs
• Algorithms for graphs embeddable with few crossings per edge
• An annotated bibliography on 1-planarity
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
• Beyond-planarity: Turán-type results for non-planar bipartite graphs
• Density of straight-line 1-planar graph drawings
• Dividing a Graph into Triconnected Components
• Drawing graphs with right angle crossings
• Ein Sechsfarbenproblem auf der Kugel
• Fáry's theorem for 1-planar graphs
• Gap-planar graphs
• Graphs drawn with few crossings per edge
• scientific article; zbMATH DE number 2123122 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• On-Line Planarity Testing
• Optimal 1-planar graphs which triangulate other surfaces
• Parameterized complexity of 1-planarity
• Path-monotonic upward drawings of graphs
• Planar graphs: Theory and algorithms
• Quasi-planar graphs have a linear number of edges
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
• Re-embeddings of Maximum 1-Planar Graphs
• Rectilinear drawings of graphs
• Straight-line grid drawings of 3-connected 1-planar graphs
• The structure of 1-planar graphs

Cited in

(3)

• Fáry's theorem for 1-planar graphs
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
• Straight-line drawings of 1-planar graphs

This page was built for publication: Re-embedding a 1-plane graph for a straight-line drawing in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235768)