\(c\)-planarity of embedded cyclic \(c\)-graphs

DOI10.1016/j.comgeo.2017.06.016zbMath1383.05067arXiv1602.01346OpenAlexW2726996981MaRDI QIDQ1693313

Radoslav Fulek

Publication date: 12 February 2018

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

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

zbMATH Keywords

graph drawingcomplexity of decision problem\(c\)-planarity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Clustered planarity with pipes ⋮ Recognizing weakly simple polygons ⋮ Embedding graphs into embedded graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Bounded Embeddings of Graphs in the Plane ⋮ Beyond Clustered Planar Graphs ⋮ Embedding Graphs into Embedded Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strip planarity testing for embedded planar graphs
• Clustered planarity testing revisited
• Upward drawings of triconnected digraphs.
• On embedding a cycle in a plane graph
• On approximability by embeddings of cycles in the plane.
• Upward planar graphs and their duals
• Strip Planarity Testing
• Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs
• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
• Towards the Hanani-Tutte Theorem for Clustered Graphs
• Beyond Level Planarity
• Recognizing weakly simple polygons
• Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs
• Powers of tensors and fast matrix multiplication
• Computing Maximum C-Planar Subgraphs
• Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
• Clustered Planarity with Pipes
• Hierarchical planarity testing algorithms
• Shrinking the Search Space for Clustered Planarity
• Clustering Cycles into Cycles of Clusters
• C-Planarity of C-Connected Clustered Graphs
• Detecting Weakly Simple Polygons
• Multiplying matrices faster than coppersmith-winograd
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Realization of mappings
• Graph Drawing
• Planarity for clustered graphs

This page was built for publication: \(c\)-planarity of embedded cyclic \(c\)-graphs