scientific article; zbMATH DE number 7236431

DOI10.4230/LIPIcs.SoCG.2018.27zbMath1489.68187arXiv1803.07032MaRDI QIDQ5115795

Thomas Magnard, Éric Colin de Verdière, Bojan Mohar

Publication date: 18 August 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surfacegraphembeddingsimplicial complexcomputational topology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Simplicial sets and complexes in algebraic topology (55U10)

Cites Work

• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• Graph-encoded maps
• Transforming curves on surfaces
• Graph minors. XIII: The disjoint paths problem
• Deleting vertices to graphs of bounded genus
• Testing graph isotopy on surfaces
• The graph genus problem is NP-complete
• Embeddability in the 3-Sphere Is Decidable
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Genus g Graphs Have Pagenumber O(√g)
• HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM
• Testing Planarity of Partially Embedded Graphs
• Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension
• Transforming Curves on Surfaces Redux
• The word problem
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: