scientific article; zbMATH DE number 867666

MaRDI QIDQ4873779zbMATH OpenFDO

Authors Carsten Thomassen

Publication date 22 April 1996

zbMATH Keywords

embeddingsgenusgraph genus problemJordan-Schönflies theoremNP-completesurfaces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Embeddings of graphs
• On the complexity of graph embeddings
• scientific article; zbMATH DE number 4142064
• Algorithmic graph embeddings

Cited in

(15)

• Triangulating a surface with a prescribed graph
• The genus problem for cubic graphs
• Algorithmic graph embeddings
• A note on approximating graph genus
• Surface embeddability of graphs via tree-travels
• Embedding on torus of a one type of graph
• Embeddings of circular graphs
• scientific article; zbMATH DE number 4064519 (Why is no real title available?)
• scientific article; zbMATH DE number 4066918 (Why is no real title available?)
• scientific article; zbMATH DE number 4126319 (Why is no real title available?)
• scientific article; zbMATH DE number 1256757 (Why is no real title available?)
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• On the complexity of graph embeddings
• On Whole-Graph Embedding Techniques
• Errors in graph embedding algorithms

This page was built for publication:

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