Sciweavers

6 search results - page 1 / 2
» Hamiltonian degree sequences in digraphs
Sort
View
JCT
2010
75views more  JCT 2010»
13 years 2 months ago
Hamiltonian degree sequences in digraphs
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · â...
Daniela Kühn, Deryk Osthus, Andrew Treglown
DM
2008
94views more  DM 2008»
13 years 3 months ago
On low degree k-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
Karola Mészáros
COMBINATORICA
2006
69views more  COMBINATORICA 2006»
13 years 3 months ago
Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
Wesley Pegden
JAIR
1998
92views more  JAIR 1998»
13 years 3 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
JCT
1998
100views more  JCT 1998»
13 years 3 months ago
2-Partition-Transitive Tournaments
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
Barry Guiduli, András Gyárfás...