Fan-Planar Graphs

DOI10.1007/978-981-15-6533-5_8OpenAlexW3090500691MaRDI QIDQ5001660

Michael A. Bekos, Luca Grilli

Publication date: 22 July 2021

Published in: Beyond Planar Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_8

zbMATH Keywords

1-planar graphs3-quasiplanar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ The thickness of fan-planar graphs is at most three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of edges in quasi-planar graphs
• On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
• 1-fan-bundle-planar drawings of graphs
• Gap-planar graphs
• Fan-planarity: properties and complexity
• Ein Sechsfarbenproblem auf der Kugel
• On RAC drawings of 1-planar graphs
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Algorithms for graphs embeddable with few crossings per edge
• Recursive generation of simple planar 5-regular graphs and pentangulations
• Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
• Crossing Number is NP-Complete
• The crossing number ofK1,3,n andK2,3,n
• On Optimal 2- and 3-Planar Graphs
• A First Order Logic Definition of Beyond-Planar Graphs
• On the Density of Maximal 1-Planar Graphs
• Two-Planar Graphs Are Quasiplanar

This page was built for publication: Fan-Planar Graphs