Exponentially many nonisomorphic genus embeddings of K_n,m
From MaRDI portal
Publication:710593
Cites work
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- Das Geschlecht des vollständigen paaren Graphen
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
- Exponential families of non-isomorphic triangulations of complete graphs
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Genus embeddings of a type of graph
- Graphs on surfaces
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Recursive constructions for triangulations
Cited in
(3)
This page was built for publication: Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710593)