Circulant graph imbeddings

DOI10.1016/0095-8956(80)90088-XzbMath0388.05010OpenAlexW2085313050MaRDI QIDQ1250106

T. D. Parsons

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90088-x

zbMATH Keywords

automorphism groupsCayley graphstriangular imbeddingcirculant graph imbeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

An Asymptotic Approach to the Channel Assignment Problem ⋮ EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Circulant graphs and tessellations on flat tori

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs with a constant link. II
• Quotients of complete graphs: revisiting the Heawood map-coloring problem
• Genus embeddings for some complete tripartite graphs
• A note on graphs whose neighborhoods are n-cycles
• Generating all graph coverings by permutation voltage assignments
• Isomorphism of circulant graphs and digraphs
• Voltage graphs
• Graph Imbedding Problems
• Generalized Embedding Schemes
• Branched coverings of graph imbeddings
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Orientable embedding of Cayley graphs

This page was built for publication: Circulant graph imbeddings