A common cover of graphs and 2-cell embeddings

DOI10.1016/0095-8956(86)90067-5zbMath0563.05022OpenAlexW2009930440MaRDI QIDQ1057277

Bojan Mohar

Publication date: 1986

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(86)90067-5

zbMATH Keywords

orientable surfacescovering graphcell imbeddingdegree partitiondegree refinement

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 (2)

Unfoldings and Coverings of Weighted Graphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications

Cites Work

• Finite common coverings of pairs of regular graphs
• Finite common coverings of graphs
• Geometric coloring theory
• Generating all graph coverings by permutation voltage assignments
• The embeddings of a graph—A survey
• Colouring of Trivalent Polyhedra
• Properties of planar graphs with uniform vertex and face structure.
• Signierte Zellenzerlegungen. I
• THE EVENNESS OF THE NUMBER OF EDGES OF A CONVEX POLYHEDRON
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A common cover of graphs and 2-cell embeddings