124 search results - page 15 / 25 » Crossing Number of Toroidal Graphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
JGAA
2010
13 years 6 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
ENDM
2007
13 years 7 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
GD
2000
Springer
13 years 11 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
GD
2004
Springer
14 years 26 days ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...