Re-embeddings of Maximum 1-Planar Graphs

DOI10.1137/090746835MaRDI QIDQ3013145zbMATH OpenOpenAlexFDO

Authors Yusuke Suzuki

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

zbMATH Keywords

sphere1-planar graphre-embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Re-embedding of projective-planar graphs
• On properties of maximal 1-planar graphs
• On maximal planarization of nonplanar graphs
• scientific article; zbMATH DE number 1500196
• Simultaneous embedding of embedded planar graphs
• Simultaneous embedding of embedded planar graphs
• The maximal 1-planarity and crossing numbers of graphs
• scientific article; zbMATH DE number 3968606
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• On the density of maximal 1-planar graphs

Cited in

(43)

• Light subgraphs in the family of 1-planar graphs with high minimum degree
• Proper 1-immersions of graphs triangulating the plane
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• A linear-time algorithm for testing outer-1-planarity
• The density of fan-planar graphs
• Generating polyhedral quadrangulations of the projective plane
• Fan-crossing free graphs and their relationship to other beyond-planar graphs
• Contact representations of graphs in 3D
• 1-Planar Graphs
• Counting cliques in 1-planar graphs
• \(K_7\)-minors in optimal 1-planar graphs
• The stub resolution of 1-planar graphs
• Re-embedding a 1-plane graph for a straight-line drawing in linear time
• The matching extendability of optimal 1-planar graphs
• Recognizing optimal 1-planar graphs in linear time
• On restricted matching extension of 1-embeddable graphs in surfaces with small genus
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• Cyclic 4-colorings of graphs on surfaces
• Planar graphs having no proper 2-immersions in the plane. I
• Non-1-planarity of lexicographic products of graphs
• Algorithms for 1-Planar Graphs
• Cops and robbers on 1-planar graphs
• Relationship among triangulations, quadrangulations and optimal 1-planar graphs
• Every outer-1-plane graph has a right angle crossing drawing
• Fan-planarity: properties and complexity
• All 2-planar graphs having the same spanning subgraph
• \(\mathsf{NIC}\)-planar graphs
• On quasi-planar graphs: clique-width and logical description
• An annotated bibliography on 1-planarity
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• Re-1-embeddings of optimal 1-embedded graphs on the projective plane
• Optimal 1-planar multigraphs
• Maximal 1-plane graphs with dominating vertices
• \(k\)-planar graphs
• On partitioning the edges of 1-plane graphs
• Recognizing and embedding simple optimal 2-planar graphs
• New results on edge partitions of 1-plane graphs
• Characterizing and recognizing 4-map graphs
• \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
• Beyond-planarity: Turán-type results for non-planar bipartite graphs
• The maximum matching extendability and factor-criticality of 1-planar graphs
• The family of fan-planar graphs
• On optimal beyond-planar graphs

This page was built for publication: Re-embeddings of Maximum 1-Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013145)