Recognizing and embedding simple optimal 2-planar graphs

DOI10.1007/978-3-030-92931-2_6OpenAlexW4206115004MaRDI QIDQ2151433

Yanyan Li

Publication date: 1 July 2022

Full work available at URL: https://arxiv.org/abs/2108.00665

zbMATH Keywords

recognition algorithms2-planar graphsbeyond-planarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

The family of fan-planar graphs ⋮ Unnamed Item

Cites Work

• Outer 1-planar graphs
• Recognizing and drawing IC-planar 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
• Drawing graphs with right angle crossings
• Improving the crossing lemma by finding more crossings in sparse graphs
• Graphs drawn with few crossings per edge
• Recognizing optimal 1-planar graphs in linear time
• A linear-time algorithm for testing full outer-2-planarity
• Characterizing and recognizing 4-map graphs
• Testing gap \(k\)-planarity is NP-complete
• On topological graphs with at most four crossings per edge
• Fan-planarity: properties and complexity
• Ein Sechsfarbenproblem auf der Kugel
• The book thickness of 1-planar graphs is constant
• On the Number of Edges of Fan-Crossing Free Graphs
• Fáry’s Theorem for 1-Planar Graphs
• Planar and Quasi Planar Simultaneous Geometric Embedding
• Re-embeddings of Maximum 1-Planar Graphs
• Über 1-optimale Graphen
• Recognizing IC-Planar and NIC-Planar Graphs
• On Optimal 2- and 3-Planar Graphs
• A new proof of the 6 color theorem
• Planar Graphs Have Bounded Queue-Number
• Edge partitions of optimal 2-plane and 3-plane graphs

This page was built for publication: Recognizing and embedding simple optimal 2-planar graphs