Beyond Outerplanarity

DOI10.1007/978-3-319-73915-1_42zbMath1503.68213arXiv1708.08723OpenAlexW3037131127MaRDI QIDQ4625142

Steven Chaplick, Alexander Wolff, Myroslav Kryven, Andre Löffler, Giuseppe Liotta

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

On fan-crossing and fan-crossing free graphs ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems ⋮ Bundled crossings revisited ⋮ Bundled Crossings Revisited ⋮ Beyond Planar Graphs: Introduction ⋮ Quasi-planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ 2-Layer k-Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
• A linear-time algorithm for testing outer-1-planarity
• Graph minors. III. Planar tree-width
• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• Embedding planar graphs in four pages
• A Turán-type theorem on chords of a convex polygon
• Graphs drawn with few crossings per edge
• On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
• On line arrangements in the hyperbolic plane
• Applications of the crossing number
• The graph crossing number and its variants: a survey
• A generalization of diagonal flips in a convex polygon
• Treewidth of graphs with balanced separations
• Planar decompositions and the crossing number of graphs with an excluded minor
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• 1-Page and 2-Page Drawings with Bounded Number of Crossings per Edge
• Testing Full Outer-2-planarity in Linear Time
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• The Number of Edges in $k$-Quasi-planar Graphs
• Structure of Graphs with Locally Restricted Crossings
• k-Degenerate Graphs
• On the complexity of \(k\)-SAT

This page was built for publication: Beyond Outerplanarity