On partitioning the edges of 1-plane graphs
From MaRDI portal
Publication:501676
DOI10.1016/j.tcs.2016.12.004zbMath1357.05125arXiv1511.07303OpenAlexW2176910815MaRDI QIDQ501676
William J. Lenhart, Fabrizio Montecchiani, Giuseppe Liotta
Publication date: 9 January 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.07303
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
An annotated bibliography on 1-planarity ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ New results on edge partitions of 1-plane graphs ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- On drawings and decompositions of 1-planar graphs
- A note on 1-planar graphs
- The structure of 1-planar graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Graphs drawn with few crossings per edge
- Triangulating planar graphs while minimizing the maximum degree
- Surfaces, tree-width, clique-minors, and partitions
- A left-first search algorithm for planar graphs
- Outerplanar partitions of planar graphs
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Algorithms for graphs embeddable with few crossings per edge
- Graphs with forbidden subgraphs
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Fáry’s Theorem for 1-Planar Graphs
- Height-Preserving Transformations of Planar Graph Drawings
- Re-embeddings of Maximum 1-Planar Graphs
- Map graphs
- Über 1-optimale Graphen
- Contact Representations of Graphs in 3D
- Edge partition of planar sraphs into two outerplanar graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- On the Density of Maximal 1-Planar Graphs
- 1-Planarity of Graphs with a Rotation System
- Acyclic colouring of 1-planar graphs
This page was built for publication: On partitioning the edges of 1-plane graphs
