Topological Graph Theory: A Personal Account
From MaRDI portal
Publication:5300972
DOI10.1016/j.endm.2008.06.014zbMath1267.05104OpenAlexW1990992890MaRDI QIDQ5300972
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.014
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- There is one group of genus two
- Regular orientable imbeddings of complete graphs
- Nonorientable embeddings of groups
- Genus distributions for two classes of graphs
- On the genus of finite abelian groups
- Twofold triple systems and graph imbeddings
- Genus embeddings for some complete tripartite graphs
- Block designs and graph imbeddings
- Generating all graph coverings by permutation voltage assignments
- How to determine the maximum genus of a graph
- Self-dual embeddings of Cayley graphs
- Treble dodging minor methods: Ringing the cosets, on six bells
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Genus distribution of Ringel ladders
- Orientable imbeddings of Cayley graphs
- Voltage graphs
- Das Geschlecht des vollständigen paaren Graphen
- On the genus of the composition of two graphs
- On the maximum genus of a graph
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Fabian Stedman: The First Group Theorist?
- Ringing the changes
- Ringing the Cosets
- Enumerating 2-Cell Imbeddings of Connected Graphs
- Ringing the cosets. II
- Genus of cartesian products of regular bipartite graphs
- The Number of Groups of a given Genus
- Some results on the genus of a group
- Every planar map is four colorable
- Voltage graph embeddings and the associated block designs
- Branched coverings of graph imbeddings
- Efficient Imbeddings of Finite Projective Planes
- Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
- The Genus of the n-Cube
- The Genus, Regional Number, and Betti Number of a Graph
- Additivity of the genus of a graph
- The genus of K12s
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Le problème des régions voisines sur les surfaces closes orientables
- The Genus of Repeated Cartesian Products of Bipartite Graphs
- On the Genus of a Group
- Orientable embedding of Cayley graphs
