Bounded Embeddings of Graphs in the Plane

DOI10.1007/978-3-319-44543-4_3zbMath1478.68235arXiv1610.07144OpenAlexW2534301164MaRDI QIDQ2819488

Radoslav Fulek

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

PQ-treealgebraic crossing numberc-planaritygraph planarity testingweakly simple embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Hanani-Tutte for Radial Planarity II ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Beyond Clustered Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On simultaneous planar graph embeddings
• Upward drawings of triconnected digraphs.
• On embedding a cycle in a plane graph
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• PC trees and circular-ones arrangements.
• \(c\)-planarity of embedded cyclic \(c\)-graphs
• Incremental convex planarity testing
• Bounds for generalized thrackles
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
• Hanani–Tutte, Monotone Drawings, and Level-Planarity
• Strip Planarity Testing
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
• Towards the Hanani-Tutte Theorem for Clustered Graphs
• Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
• Towards an implementation of the 3D visibility skeleton
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Total Ordering Problem
• Lectures on Polytopes
• Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
• Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
• Hierarchical planarity testing algorithms
• Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
• Clustering Cycles into Cycles of Clusters
• C-Planarity of C-Connected Clustered Graphs
• Detecting Weakly Simple Polygons
• Graph Drawing
• Graph Drawing

This page was built for publication: Bounded Embeddings of Graphs in the Plane