An annotated bibliography on 1-planarity

DOI10.1016/j.cosrev.2017.06.002zbMath1398.68402arXiv1703.02261OpenAlexW3104418588WikidataQ62042375 ScholiaQ62042375MaRDI QIDQ2407041

Giuseppe Liotta, Stephen G. Kobourov, Fabrizio Montecchiani

Publication date: 28 September 2017

Published in: Computer Science Review (Search for Journal in Brave)

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

zbMATH Keywords

1-planarity annotated bibliography beyond planar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Tree densities in sparse graph classes, On the Size of Matchings in 1-Planar Graph with High Minimum Degree, A survey on book-embedding of planar graphs, Optimal-area visibility representations of outer-1-plane graphs, On fan-crossing and fan-crossing free graphs, Recognizing IC-Planar and NIC-Planar Graphs, Packing 1-plane Hamiltonian cycles in complete geometric graphs, On RAC drawings of 1-planar graphs, Dynamic list coloring of 1-planar graphs, Packing Trees into 1-planar Graphs, The Stub Resolution of 1-planar Graphs, Drawing outer-1-planar graphs revisited, Parameterized analysis and crossing minimization problems, Fan-crossing free graphs and their relationship to other beyond-planar graphs, On quasi-planar graphs: clique-width and logical description, Partially broken orientations of Eulerian plane graphs, $(k,p)$-planarity: a relaxation of hybrid planarity, On morphing 1-planar drawings, 1-planar graphs are odd 13-colorable, Improved product structure for graphs on surfaces, Straight-line drawings of 1-planar graphs, Matchings in 1‐planar graphs with large minimum degree, k-Planar Placement and Packing of Δ-Regular Caterpillars, Book embeddings of $k$-framed graphs and $k$-map graphs, All 2-planar graphs having the same spanning subgraph, On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs, The family of fan-planar graphs, New results on edge partitions of 1-plane graphs, Weak-dynamic coloring of graphs beyond-planarity, Graph product structure for non-minor-closed classes, Optimal 1-planar multigraphs, A new note on 1-planar graphs with minimum degree 7, On fan-crossing graphs, $\mathsf{T}$-shape visibility representations of 1-planar graphs, 1-fan-bundle-planar drawings of graphs, On the curve complexity of 3-colored point-set embeddings, Unnamed Item, Unnamed Item, 3D Visibility Representations of 1-planar Graphs, Gap-Planar Graphs, Beyond Outerplanarity, Turning cliques into paths to achieve planarity, Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles, Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity, On the $k$-planar local crossing number, On $(p, 1)$-total labelling of some 1-planar graphs, Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, Complexity of Geometric k-Planarity for Fixed k, Re-embedding a 1-plane graph for a straight-line drawing in linear time, Characterizing and recognizing 4-map graphs, On $(p, 1)$-total labelling of NIC-planar graphs, Embedding-preserving rectangle visibility representations of nonplanar graphs, A structure of 1-planar graph and its applications to coloring problems, Two-Planar Graphs Are Quasiplanar, Characterizing 5-map graphs by 2-fan-crossing graphs, Unnamed Item, Edge partitions of optimal 2-plane and 3-plane graphs, Compact drawings of 1-planar graphs with right-angle crossings and few bends, Ortho-polygon visibility representations of 3-connected 1-plane graphs, Gap-planar graphs, Ortho-polygon visibility representations of embedded graphs, On the sizes of bipartite 1-planar graphs, On RAC drawings of graphs with one bend per edge, Testing gap $k$-planarity is NP-complete, Planar graphs having no proper 2-immersions in the plane. I, 1-embeddability of complete multipartite graphs on the projective plane, Polyline drawings with topological constraints, Crossing numbers of beyond-planar graphs, The maximal 1-planarity and crossing numbers of graphs, Non-1-planarity of lexicographic products of graphs, Crossing numbers of beyond-planar graphs, Unnamed Item, Better bounds for poset dimension and boxicity, Equitable partition of plane graphs with independent crossings into induced forests, On Layered Fan-Planar Graph Drawings, On 3D visibility representations of graphs with few crossings per edge, Beyond Planar Graphs: Introduction, Quantitative Restrictions on Crossing Patterns, 1-Planar Graphs, Edge Partitions and Visibility Representations of 1-planar Graphs, $$\textit{\textbf{k}}$$-Planar Graphs, 1-planarity testing and embedding: an experimental study, From light edges to strong edge-colouring of 1-planar graphs, A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces, Counting cliques in 1-planar graphs, The structure and the list 3-dynamic coloring of outer-1-planar graphs, 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Uses Software

gCol

Cites Work