The embeddings of a graph—A survey

DOI10.1002/JGT.3190020402zbMath0406.05027OpenAlexW2034732199MaRDI QIDQ4192084

Saul Stahl

Publication date: 1978

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190020402

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Quotients of complete graphs: revisiting the Heawood map-coloring problem
• On the genus of the composition of two graphs
• A Kuratowski-type theorem for the maximum genus of a graph
• On the Genus of Strong Tensor Products of Graphs
• The Genus of the n-Cube
• On the surface duality of linear graphs
• The Genus, Regional Number, and Betti Number of a Graph
• Map-Colour Theorems

Related Items (19)

Enumeration of graph embeddings ⋮ Nonorientable genus of nearly complete bipartite graphs ⋮ Embedding rectilinear graphs in linear time ⋮ Embeddings of one kind of graphs ⋮ On the genus of joins and compositions of graphs ⋮ A survey on tree matching and XML retrieval ⋮ An algorithm for imbedding cubic graphs in the torus ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Algebraic classification of actions invariant under generalized flip moves of two-dimensional graphs ⋮ EMBEDDING OF METRIC GRAPHS ON HYPERBOLIC SURFACES ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Universal coverings of PL-manifolds via coloured graphs ⋮ On planarity of graphs in homotopy type theory ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ An obstruction to embedding graphs in surfaces ⋮ The maximum genus of graphs with diameter three ⋮ Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces ⋮ A common cover of graphs and 2-cell embeddings ⋮ Embeddings of infinite graphs

This page was built for publication: The embeddings of a graph—A survey