On the genus of the tensor product of graphs where one factor is a regular graph

DOI10.1016/0012-365X(93)E0057-BzbMath0812.05019OpenAlexW2057894481MaRDI QIDQ1339860

Tamara Dakić, Tomaž Pisanski

Publication date: 7 May 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0057-b

zbMATH Keywords

1-factorregular graphgenustensor productimbeddingorientable surface2-cell embeddingpermutation voltage graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Imbeddings of the tensor product of graphs where the second factor is a complete graph ⋮ Distance-residual subgraphs ⋮ Unnamed Item

Cites Work

• The Kronecker Product of Graphs
• Embeddings of cartesian products of nearly bipartite graphs
• On the Genus of Strong Tensor Products of Graphs
• Boolean Operations on Graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the genus of the tensor product of graphs where one factor is a regular graph