Results 191 to 200 of about 382 (214)

Hamiltonian cycles in delaunay complexes

1989
We restate a conjecture concerning the existence of Hamiltonian cycles in graphs resulting from the Delaunay triangulation of point sets in the plane R2. We introduce the notion of Delaunay complex, the natural completion of a Delaunay triangulation. We show that Delaunay complexes are necessarily 3-connected.
Henry Crapo, Jean-Paul Laumond
openaire   +1 more source

Hamiltonian Cycles in Regular Tournaments

Combinatorics, Probability and Computing, 2007
We show that every regular tournament on n vertices has at least n!/(2 + o(1)) n Hamiltonian cycles, thus answering a question of Thomassen [17] and providing a partial answer to a question of Friedgut and Kahn [7]. This compares to an upper bound of about O(n0.25n!/2 n ) for arbitrary tournaments due to Friedgut and Kahn ...
openaire   +1 more source

Hamiltonian cycles in bipartite graphs

Combinatorica, 1995
Let \(G= (X, Y; E)\) be a balanced bipartite graph with vertex classes \(X\), \(Y\), edge set \(E\), and \(|X|= |Y|= n\). The balanced independence number \(\alpha^*(G)\) is defined to be \[ \max\{|A|: A\subseteq X\cup Y\wedge A\text{ is independent }\wedge \bigl||A\cap X|- |A\cap Y|\bigr|\leq 1\}.
openaire   +2 more sources

Hamiltonian Cycles in Products of Graphs

Canadian Mathematical Bulletin, 1975
Let V(G) and E(G) denote the vertex set and the edge set of a graph G; let Kn denote the complete graph with n vertices and let Kn, m denote the complete bipartite graph on n and m vertices. A Hamiltonian cycle (Hamiltonian path, respectively) in a graph G is a cycle (path, respectively) in G that contains all the vertices of G.
openaire   +1 more source

Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs

Discrete Mathematics, 2023
Yaojun Chen
exaly  

Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs

SIAM Journal on Computing, 1994
Jitender Deogun
exaly  

Cyclic Hamiltonian cycle systems of the complete graph

Discrete Mathematics, 2004
Marco Buratti
exaly  

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions

Applied Mathematics and Computation, 2011
Tzu-Liang Kung, Lih-Hsing Hsu
exaly  

Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor

Discrete Mathematics, 2008
Joy Morris
exaly  

Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1,3-structure faults

Journal of Parallel and Distributed Computing, 2018
Xiaohua Jia, Jianxi Fan, Yali Lv
exaly