Edge Partitions and Visibility Representations of 1-planar Graphs
From MaRDI portal
Publication:5001658
DOI10.1007/978-981-15-6533-5_6zbMath1476.05141OpenAlexW3090990029MaRDI QIDQ5001658
Fabrizio Montecchiani, Giuseppe Liotta
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_6
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- On drawings and decompositions of 1-planar graphs
- A note on 1-planar graphs
- On partitioning the edges of 1-plane graphs
- Characterisations and examples of graph classes with bounded expansion
- Ortho-polygon visibility representations of embedded graphs
- An upper bound on the number of edges in an almost planar bipartite graph
- An experimental study of a 1-planarity testing and embedding algorithm
- A linear-time algorithm for 7-coloring 1-plane graphs
- L-visibility drawings of IC-planar graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Representing a planar graph by vertical lines joining different levels
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Graphs drawn with few crossings per edge
- Visibility representations of boxes in 2.5 dimensions
- New results on edge partitions of 1-plane graphs
- Recognizing optimal 1-planar graphs in linear time
- Surfaces, tree-width, clique-minors, and partitions
- Outerplanar partitions of planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Density of straight-line 1-planar graph drawings
- On representations of some thickness-two graphs
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- On 3D visibility representations of graphs with few crossings per edge
- An annotated bibliography on 1-planarity
- The book thickness of 1-planar graphs is constant
- \(\mathsf{NIC}\)-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Graphs with forbidden subgraphs
- 1-Visibility Representations of 1-Planar Graphs
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- Coloring plane graphs with independent crossings
- Edge-Disjoint Spanning Trees of Finite Graphs
- Further Results on Bar k-Visibility Graphs
- Edge partition of planar sraphs into two outerplanar graphs
- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- A Visibility Representation for Graphs in Three Dimensions
- RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
- Parameterized Complexity of 1-Planarity
- On the Density of Maximal 1-Planar Graphs
- Drawing graph joins in the plane with restrictions on crossings
- Planar Graphs Have Bounded Queue-Number
- Planar Graphs of Bounded Degree Have Bounded Queue Number
- Bar k-Visibility Graphs
- Structure of Graphs with Locally Restricted Crossings
- Ortho-polygon visibility representations of 3-connected 1-plane graphs
- Edge partitions of optimal 2-plane and 3-plane graphs
