The embeddings of a graph—A survey

DOI10.1002/JGT.3190020402zbMATH Open0406.05027OpenAlexW2034732199MaRDI QIDQ4192084FDOQ4192084

Authors: 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

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

Cited In (19)

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

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

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