Sciweavers

409 search results - page 52 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
WSC
1998
13 years 9 months ago
Toward Increased Use of Simulation in Transportation
The validity and usefulness of system simulation has been well-established for decades in areas such as computer and communications systems, general manufacturing systems, and mil...
Daniel T. Brunner, Gary Cross, Catherine McGhee, J...
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 7 months ago
Track Layouts of Graphs
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
Vida Dujmovic, Attila Pór, David R. Wood
JGAA
1998
116views more  JGAA 1998»
13 years 7 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
JSC
2010
82views more  JSC 2010»
13 years 2 months ago
The first rational Chebyshev knots
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
Pierre-Vincent Koseleff, D. Pecker, F. Rouillier
EJC
2011
12 years 11 months ago
Two enumerative results on cycles of permutations
Answering a question of B´ona, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if...
Richard P. Stanley