Branched coverings of graph imbeddings
From MaRDI portal
Publication:4767331
DOI10.1090/S0002-9904-1973-13270-7zbMATH Open0281.05101OpenAlexW2086081221MaRDI QIDQ4767331FDOQ4767331
Seth R. Alpert, Jonathan L. Gross
Publication date: 1973
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1973-13270-7
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Title not available (Why is that?)
- Title not available (Why is that?)
- The topological theory of current graphs
- Title not available (Why is that?)
- Orientable embedding of Cayley graphs
- The heawood map-coloring problem—Cases 1, 7, and 10
- Title not available (Why is that?)
Cited In (16)
- Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
- Genus embeddings for some complete tripartite graphs
- Vertex-transitive polyhedra of higher genus. I
- Components of branched coverings of current graphs
- Voltage graphs
- The topological theory of current graphs
- On the connectivity of graphs embedded in surfaces
- Topological Graph Theory: A Personal Account
- Algebraic specification of interconnection network relationships by permutation voltage graph mappings
- Circulant graph imbeddings
- Signatures, Lifts, and Eigenvalues of Graphs
- The medial graph and voltage-current duality
- Block designs and graph imbeddings
- Observations on the construction of covers using permutation voltage assignments
- The genus of nearly complete graphs-case 6
- Embeddings of covering projections of graphs
This page was built for publication: Branched coverings of graph imbeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767331)