Results 271 to 280 of about 2,225,625 (302)
Some of the next articles are maybe not open access.
Hamilton cycles in plane triangulations
Journal of Graph Theory, 2002AbstractWe extend Whitney's Theorem that every plane triangulation without separating triangles is hamiltonian by allowing some separating triangles. More precisely, we define a decomposition of a plane triangulation G into 4‐connected ‘pieces,’ and show that if each piece shares a triangle with at most three other pieces then G is hamiltonian.
Bill Jackson, Xingxing Yu
openaire +1 more source
The Hamilton‐Waterloo problem for Hamilton cycles and triangle‐factors
Journal of Combinatorial Designs, 2011AbstractIn this article, we consider the Hamilton‐Waterloo problem for the case of Hamilton cycles and triangle‐factors when the order of the complete graph Kn is even. We completely solved the problem for the case n≡24 (mod 36). For the cases n≡0 (mod 18) and n≡6 (mod 36), we gave an almost complete solution. © 2012 Wiley Periodicals, Inc. J.
Lei, Hongchuan, Shen, Hao
openaire +2 more sources
Hamilton cycles in a random tournament
Random Structures & Algorithms, 1995AbstractThe number of Hamilton cycles in a random tournament is asymptotically normally distributed.
openaire +3 more sources
Packing Directed Hamilton Cycles Online
SIAM Journal on Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Anastos, Joseph Briggs
openaire +3 more sources
Hamilton Cycles in Random Regular Digraphs
Combinatorics, Probability and Computing, 1994We prove that almost every r-regular digraph is Hamiltonian for all fixed r ≥ 3.
Colin Cooper +2 more
openaire +3 more sources
On hamilton cycles and hamilton cycle decompositions of graphs based on groups [PDF]
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposition of a k-regular graph is defined as the partition of the edge set into Hamilton cycles if k is even, or a partition into Hamilton cycles and a 1-factor, if k is odd.
openaire +1 more source
Hamilton cycles in claw‐free graphs
Journal of Graph Theory, 1988AbstractBondy conjectured that if G is a k‐connected graph of order n such that magnified image for any (k + 1)‐independent set / of G, then the subgraph outside any longest cycle contains no path of length k − 1. In this paper, we are going to prove that, if G is a k‐connected claw‐free (K1,3‐free) graph of order n such that magnified image for any (k
openaire +3 more sources
Spectral radius and the 2-power of Hamilton cycle
Discrete Mathematics, 2023Lihua Feng, Xiaocong He, Yan Inrush
exaly