21 search results - page 1 / 5 » A Dirac-Type Result on Hamilton Cycles in Oriented Graphs |
CPC
2008
13 years 6 months ago
2008
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
SIAMDM
2008
13 years 5 months ago
2008
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable co...
COMBINATORICS
2002
13 years 6 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
SAC
2010
ACM
14 years 1 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...