Recognizing Weak Embeddings of Graphs

DOI10.1145/3344549zbMath1454.68089OpenAlexW2979847601WikidataQ127113073 ScholiaQ127113073MaRDI QIDQ4973046

Radoslav Fulek, Hugo A. Akitaya, 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

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

Related Items (5)

Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ Embedding graphs into embedded graphs ⋮ Beyond Clustered Planar Graphs

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