Recommendations
Cites work
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- 1-planarity of graphs with a rotation system
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for testing outer-1-planarity
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Crossing number is hard for cubic graphs
- Density of straight-line 1-planar graph drawings
- Depth-First Search and Kuratowski Subgraphs
- Ein Sechsfarbenproblem auf der Kugel
- Every outer-1-plane graph has a right angle crossing drawing
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Fáry's theorem for 1-planar graphs
- Graphs drawn with few crossings per edge
- How to draw a planar graph on a grid
- Kuratowski's theorem
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On the Queue Number of Planar Graphs
- On the density of maximal 1-planar graphs
- On-Line Planarity Testing
- Parameterized complexity of 1-planarity
- Planarity and duality of finite and infinite graphs
- Recognizing outer 1-planar graphs in linear time
- Rectilinear drawings of graphs
- Right angle crossing graphs and 1-planarity
- Small area drawings of outerplanar graphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Straight-line grid drawings of 3-connected 1-planar graphs
- The book thickness of a graph
- The structure of 1-planar graphs
Cited in
(40)- Correction to: ``Outer 1-planar graphs
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- Recognizing and embedding simple optimal 2-planar graphs
- Recognizing outer 1-planar graphs in linear time
- 2-Layer k-Planar Graphs
- Total coloring of outer-1-planar graphs: the cold case
- On book crossing numbers of the complete graph
- The family of fan-planar graphs
- Linear arboricity of outer-1-planar graphs
- Algorithms for 1-Planar Graphs
- Nonplanar Graph Drawings with k Vertices per Face
- 1-planarity testing and embedding: an experimental study
- Drawing outer-1-planar graphs revisited
- Drawing outer-1-planar graphs revisited
- Beyond outerplanarity
- Characterizing and recognizing 4-map graphs
- Strong Edge Coloring of Outerplane Graphs with Independent Crossings
- On fan-crossing and fan-crossing free graphs
- Cops and robbers on 1-planar graphs
- The matching extendability of optimal 1-planar graphs
- Gap-Planar Graphs
- Optimal-area visibility representations of outer-1-plane graphs
- 1-Planar Graphs
- Total coloring of outer-1-planar graphs with near-independent crossings
- \(\mathsf{NIC}\)-planar graphs
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- \(k\)-planar graphs
- On Aligned Bar 1-Visibility Graphs
- An annotated bibliography on 1-planarity
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Recognizing optimal 1-planar graphs in linear time
- Beyond planar graphs: introduction
- Incidence coloring of outer-1-planar graphs
- Gap-planar graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- scientific article; zbMATH DE number 6381690 (Why is no real title available?)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Light paths and edges in families of outer-1-planar graphs
- Recognizing IC-planar and NIC-planar graphs
- Remarks on the joins of 1-planar graphs
This page was built for publication: Outer 1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289919)
