Some problems in topological graph theory
From MaRDI portal
Publication:3885782
DOI10.1002/jgt.3190040302zbMath0443.05036OpenAlexW1992235392MaRDI QIDQ3885782
Jonathan L. Gross, Frank Harary
Publication date: 1980
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190040302
algorithmsthicknessCayley graphscrossing numbercoarsenessSchreier graphstopological graph theorygenus of groupsgenus of graphsembedding 2-dimensional complexes into surfaces
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (2)
On the genus of \({\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\) ⋮ The Cartesian product of three triangles can be embedded into a subspace of genus 7
Cites Work
- An algorithm for imbedding cubic graphs in the torus
- A Linear Time Planarity Algorithm for 2-Complexes
- Efficient Planarity Testing
- An efficient algorithm for determining whether a cubic graph is toroidal
- The Coarseness of the Complete Graph
- On the Möbius Ladders
- On the genera of graphs of group presentations
This page was built for publication: Some problems in topological graph theory