Recognizing Weak Embeddings of Graphs

DOI10.1145/3344549MaRDI QIDQ4973046zbMATH OpenOpenAlexWikidataFDO

Authors Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth

Publication date 2 December 2019

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3344549

zbMATH Keywords

graph embeddinggraph operations

Mathematics Subject Classification ID

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

Recommendations

• Recognizing weak embeddings of graphs
• Weak embedding of planar graphs
• scientific article; zbMATH DE number 51713
• Embeddings of graphs
• scientific article; zbMATH DE number 4164896
• scientific article; zbMATH DE number 4126319
• Recognizing weakly triangulated graphs by edge separability
• scientific article; zbMATH DE number 1617254
• Weak sense of direction labelings and graph embeddings
• Publication:4722086

Cited in

(7)

• Recognizing weak embeddings of graphs
• Beyond Clustered Planar Graphs
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Making multicurves cross minimally on surfaces
• Embedding graphs into embedded graphs

This page was built for publication: Recognizing Weak Embeddings of Graphs

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