Circulant graph imbeddings

DOI10.1016/0095-8956(80)90088-XzbMATH Open0388.05010OpenAlexW2085313050MaRDI QIDQ1250106FDOQ1250106

Authors: 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

Cayley graphsautomorphism groupstriangular imbeddingcirculant graph imbeddings

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)