Circulant graph imbeddings
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- scientific article; zbMATH DE number 3641494 (Why is no real title available?)
- scientific article; zbMATH DE number 3281340 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3326356 (Why is no real title available?)
- scientific article; zbMATH DE number 3379174 (Why is no real title available?)
- scientific article; zbMATH DE number 3422404 (Why is no real title available?)
- A note on graphs whose neighborhoods are n-cycles
- Branched coverings of graph imbeddings
- Generalized Embedding Schemes
- Generating all graph coverings by permutation voltage assignments
- Genus embeddings for some complete tripartite graphs
- Graph Imbedding Problems
- Isomorphism of circulant graphs and digraphs
- On graphs with a constant link. II
- Orientable embedding of Cayley graphs
- Quotients of complete graphs: revisiting the Heawood map-coloring problem
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Voltage graphs
Cited in
(4)
This page was built for publication: Circulant graph imbeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250106)