Toroidal graph

Known as: Toroidal, Torus graph 
In mathematics, a toroidal graph is a graph that can be embedded on a torus. In other words, the graph's vertices can be placed on a torus such that… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1953-2018
020040060019532017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
If a graph can be embedded in a torus in such a way that all noncontractible cycles have length at least 8, then its vertices may… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
2007
2007
CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph… (More)
  • figure 1
Is this relevant?
2005
2005
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Williams independently… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The most thoroughly understood example of superstring compactification is compactification on a fiat torus [1]. This example is… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We study toroidal compactification of Matrix theory, using ideas and results of noncommutative geometry. We generalize this to… (More)
Is this relevant?
1997
1997
It is well known that not all 3-connected planar graphs are hamiltonian. Whitney [10] proved that every triangulation of the… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
It is argued that every Calabi-Yau manifold X with a mirror Y admits a family of supersymmetric toroidal 3-cycles. Moreover the… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The effective action for type II string theory compactified on a six torus is N = 8 supergravity, which is known to have an E 7… (More)
  • table 1
  • table 2
Is this relevant?
1982
1982
If a graph can be embedded in a torus in such a way that all noncontractible cycles have length at least 8, then its vertices may… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1977
Highly Cited
1977
In many scientific and technical endeavors, a three-dimensional solid must be reconstructed from serial sections, either to aid… (More)
Is this relevant?