Some problems in topological graph theory

DOI10.1002/JGT.3190040302MaRDI QIDQ3885782zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

algorithmsCayley graphscoarsenesscrossing numberembedding 2-dimensional complexes into surfacesgenus of graphsgenus of groupsSchreier graphsthicknesstopological graph theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• A Linear Time Planarity Algorithm for 2-Complexes
• An algorithm for imbedding cubic graphs in the torus
• An efficient algorithm for determining whether a cubic graph is toroidal
• Efficient Planarity Testing
• On the genera of graphs of group presentations
• On the Möbius Ladders
• The Coarseness of the Complete Graph

Cited in

(4)

• The Cartesian product of three triangles can be embedded into a subspace of genus 7
• On the genus of \({\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\times {\mathbb{Z}}_ 3\)
• The thickness of some complete bipartite and tripartite graphs
• Cycles in T-graphs

This page was built for publication: Some problems in topological graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885782)