Re-embeddings of Maximum 1-Planar Graphs
From MaRDI portal
Publication:3013145
DOI10.1137/090746835zbMath1221.05099OpenAlexW2079157536MaRDI QIDQ3013145
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090746835
Related Items (42)
The density of fan-planar graphs ⋮ Contact Representations of Graphs in 3D ⋮ EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ \(K_7\)-minors in optimal 1-planar graphs ⋮ On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ On quasi-planar graphs: clique-width and logical description ⋮ An annotated bibliography on 1-planarity ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ 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 ⋮ Maximal 1-plane graphs with dominating vertices ⋮ The maximum matching extendability and factor-criticality of 1-planar graphs ⋮ Relationship among triangulations, quadrangulations and optimal 1-planar graphs ⋮ New results on edge partitions of 1-plane graphs ⋮ Optimal 1-planar multigraphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Unnamed Item ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Characterizing and recognizing 4-map graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ The matching extendability of optimal 1-planar graphs ⋮ Light subgraphs in the family of 1-planar graphs with high minimum degree ⋮ Unnamed Item ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Planar graphs having no proper 2-immersions in the plane. I ⋮ Non-1-planarity of lexicographic products of graphs ⋮ Generating polyhedral quadrangulations of the projective plane ⋮ 1-Planar Graphs ⋮ Algorithms for 1-Planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-planarity: properties and complexity ⋮ Counting cliques in 1-planar graphs
This page was built for publication: Re-embeddings of Maximum 1-Planar Graphs
