The embeddings of a graph—A survey
From MaRDI portal
Publication:4192084
Cites work
- A Kuratowski-type theorem for the maximum genus of a graph
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- Map-Colour Theorems
- On the Genus of Strong Tensor Products of Graphs
- On the genus of the composition of two graphs
- On the surface duality of linear graphs
- Quotients of complete graphs: revisiting the Heawood map-coloring problem
- The Genus of the n-Cube
- The Genus, Regional Number, and Betti Number of a Graph
Cited in
(19)- 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
- Nonorientable genus of nearly complete bipartite graphs
- Embedding rectilinear graphs in linear time
- An algorithm for imbedding cubic graphs in the torus
- On the number of maximum genus embeddings of almost all graphs
- Universal coverings of PL-manifolds via coloured graphs
- An obstruction to embedding graphs in surfaces
- The maximum genus of graphs with diameter three
- Enumeration of graph embeddings
- Embeddings of one kind of graphs
- On the genus of joins and compositions of graphs
- A survey on tree matching and XML retrieval
- Algebraic classification of actions invariant under generalized flip moves of two-dimensional graphs
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Embedding of metric graphs on hyperbolic surfaces
- Excluding a planar matching minor in bipartite graphs
- On planarity of graphs in homotopy type theory
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)
