212 search results - page 18 / 43 » On Lengths of Rainbow Cycles |
131
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
164
click to vote
DM
2006
15 years 6 months ago
2006
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
141
click to vote
TSMC
1998
15 years 5 months ago
1998
— This paper extends the authors’ previous results on fault tolerant locomotion of the hexapod robot on even terrain by relaxing nonoverlap of redefined reachable cells of leg...
149
click to vote
PE
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
169
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...