Enumerating Unlabelled Embeddings of Digraphs
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Recommendations
- Enumeration of digraph embeddings
- Enumeration of graph embeddings
- Digraph embedding
- On ranking and unranking labeled digraphs
- Enumeration of unlabeled directed hypergraphs
- Enumeration of unlabeled uniform hypergraphs
- Enumeration of unlabelled graphs with specified degree parities
- scientific article; zbMATH DE number 2192213
- scientific article; zbMATH DE number 51713
- Embeddings of graphs
Cited in
(8)- Enumeration of graph embeddings
- Obstructions to directed embeddings of Eulerian digraphs in the plane
- Enumeration of digraph embeddings
- scientific article; zbMATH DE number 3877221 (Why is no real title available?)
- The genus distributions of 4-regular digraphs
- Enumerating the orientable 2-cell imbeddings of complete bipartite graphs
- Embedding quartic Eulerian digraphs on the plane
- scientific article; zbMATH DE number 7535271 (Why is no real title available?)
This page was built for publication: Enumerating Unlabelled Embeddings of Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5373963)