388 search results - page 13 / 78 » On the Number of Cycles in Planar Graphs |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
WG
2004
Springer
14 years 1 months ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
JCT
2011
12 years 10 months ago
2011
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
NIPS
1996
13 years 9 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
IM
2007
13 years 7 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...