Results 1  10
of
2,937
Discrete Applied Mathematics 99 (2000) 245{249 Pancyclic outarcs of a vertex in tournaments(
, 1999
"... Thomassen (J. Combin. Theory Ser. B 28, 1980, 142{163) proved that every strong tournament contains a vertex x such that each arc going out from x is contained in a Hamiltonian cycle. In this paper, we extend the result of Thomassen and prove that a strong tournament contains a vertex x such that ev ..."
Abstract
 Add to MetaCart
such that every arc going out from x is pancyclic, and our proof yields a polynomial algorithm to nd such a vertex. Furthermore, as another consequence of our main theorem, we get a result of Alspach (Canad. Math. Bull. 10, 1967, 283{286) that states that every arc of a regular tournament is pancyclic.? 2000
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacked coup deposed the reformist government of Col. Jacobo Arbenz Guzmán in 1954. Moderates of the political center. embattled but alive in E1 Salvador, have virtually disappeared in Guatemalajoining more than 30.000 victims of terror over the last tifteen vears. “The situation in Guatemala is much more serious than in EI Salvador, ” declares one Latin American diplomat. “The oligarchy is that much more reactionary. and the choices are far fewer. “ ‘Zero’: The Guatemalan oligarchs hated Jimmy Carter for cutting off U.S. military aid in 1977 to protest humanrights abusesand the rightwingers hired marimba bands and set off firecrackers on the night Ronald Reagan was elected. They considered Reagan an ideological kinsman and believed they had a special
CyclePancyclism in Tournaments III
 Graphs and Combinatorics
, 1995
"... Let T be a hamiltonian tournament with n vertices and fl a hamiltonian cycle of T . For a cycle C k of length k in T we denote I fl (C k ) = jA(fl) " A(C k )j, the number of arcs that fl and C k have in common. Let f(n; k; T; fl) = maxfI fl (C k )jC k ae Tg and f(n; k) = minff(n; k; T; fl)jT is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let T be a hamiltonian tournament with n vertices and fl a hamiltonian cycle of T . For a cycle C k of length k in T we denote I fl (C k ) = jA(fl) " A(C k )j, the number of arcs that fl and C k have in common. Let f(n; k; T; fl) = maxfI fl (C k )jC k ae Tg and f(n; k) = minff(n; k; T; fl
A Conjecture on CyclePancyclism in Tournaments
, 1998
"... Let T be a hamiltonian tournament with n vertices and fl a hamiltonian cycle of T . ..."
Abstract
 Add to MetaCart
Let T be a hamiltonian tournament with n vertices and fl a hamiltonian cycle of T .
VertexPancyclicity of
, 2007
"... Abstract: A hypertournament or a ktournament, on n vertices, 2kn, is a pair TD (V;E), where the vertex setV is a set of size n and the edge setE is the collection of all possible subsets of size k of V, called the edges, each taken in one of its k! possible permutations. A ktournament is pancyclic ..."
Abstract
 Add to MetaCart
is pancyclic if there exists (directed) cycles of all possible lengths; it is vertexpancyclic if moreover the cycles can be found through any vertex. A ktournament is strong if there is a path from u to v for each pair of distinct vertices u and v. A question posed by Gutin and Yeo about the characterization
Diregular cPartite Tournaments Are VertexPancyclic when c ≥ 5
, 1997
"... In [4] it is conjectured that all diregular cpartite tournaments, with c ≥ 4, are pancyclic. In this paper we show that all diregular cpartite tournaments, with c ≥ 5, are in fact vertexpancyclic. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In [4] it is conjectured that all diregular cpartite tournaments, with c ≥ 4, are pancyclic. In this paper we show that all diregular cpartite tournaments, with c ≥ 5, are in fact vertexpancyclic.
Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
, 1995
"... A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite digraph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with end vertice ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite digraph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with end
Vertexpancyclicity of hypertournaments
 J. Graph Theory
"... Let V be a nset (set of size n). Let E be the collection of all possible ksubsets (subsets of size k) of V, 2 k n, each taken in one of its k! possible permutations. A pair T = (V; E) is called a hypertournament, or a ktournament. Each element of V is a vertex, and each ordered ktuple of E is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
xi and distinct edges ei so that xi1 dominates xi via ei, i = 1; : : : ; `. Such a path has length `. A cycle is a path when all vertices are distinct except x0 = x`. A path (cycle) of T is Hamiltonian if it contains all vertices of T. A ktournament T is pancyclic if it contains cycles of all
Results 1  10
of
2,937