Recognizing weak embeddings of graphs

MaRDI QIDQ4607898zbMATH OpenFDO

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

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1709.09209, http://dl.acm.org/citation.cfm?id=3175287

Mathematics Subject Classification ID

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

Recommendations

• Recognizing Weak Embeddings of Graphs
• Weak embedding of planar graphs
• Embedding planar graphs at fixed vertex locations
• Testing graph isotopy on surfaces
• Testing graph isotopies on surfaces

Cited in

(10)

• Clustered planarity = flat clustered planarity
• Stability of intersections of graphs in the plane and the van Kampen obstruction
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Clustered planarity with pipes
• Recognizing Weak Embeddings of Graphs
• Hanani-Tutte for approximating maps of graphs
• Drawing clustered planar graphs on disk arrangements
• Crossing minimization in perturbed drawings
• Crossing minimization in perturbed drawings
• Shelling and sinking graphs on the sphere

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 Q4607898)