This paper surveys recent results on circuits in toroidal imbeddings of graphs, focusing on methods relating toroidal graphs to integer polygons in the Euclidean plane. The results and methods connect with convexity theory, the geometry of numbers, and graph minors.
Recommendations
Cites work
- A generalization of max flow—min cut
- An Introduction to the Geometry of Numbers
- Classification of minimal graphs of given face-width on the torus
- Decomposition of graphs on surfaces and a homotopic circulation theorem
- Directed circuits on a torus
- Disjoint circuits of prescribed homotopies in a graph on a compact surface
- Disjoint cycles in directed graphs on the torus and the Klein bottle
- Edge-disjoint circuits in graphs on the torus
- Edmonds polytopes and a hierarchy of combinatorial problems
- Graph minors. VII: Disjoint paths on a surface
- Graphs on the torus and geometry of numbers
- Grid minors of graphs on the torus
- Homotopy and crossings of systems of curves on a surface
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3709228 (Why is no real title available?)
- scientific article; zbMATH DE number 3316189 (Why is no real title available?)
- On the uniqueness of kernels
Cited in
(9)- Edge-disjoint circuits in graphs on the torus
- Graphs on the torus and geometry of numbers
- Tutte cycles in circuit graphs
- Dense bipartite circulants and their routing via rectangular twisted torus
- Face-width of embedded graphs
- scientific article; zbMATH DE number 431515 (Why is no real title available?)
- Lower bounds for electrical reduction on surfaces
- WITHDRAWN: Circulant graphs and tessellations on flat tori
- Intersection norms on surfaces and Birkhoff sections for geodesic flows
This page was built for publication: Circuits in graphs embedded on the torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199633)
