Results 1 to 10 of about 64,068 (309)
Identifying Hamilton cycles in the Cartesian product of directed cycles [PDF]
Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +2 more sources
k-Ordered Hamilton cycles in digraphs [PDF]
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which encounters these vertices in this order.
Daniela Kühn +2 more
openalex +3 more sources
M-alternating Hamilton paths and M-alternating Hamilton cycles [PDF]
published in Discrete ...
Zan‐Bo Zhang, Yueping Li, Dingjun Lou
openalex +3 more sources
Hamilton Cycles in Double Generalized Petersen Graphs
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduced the double generalized Petersen graphs (DGPGs). Kutnar and Petecki proved that DGPGs are Hamiltonian in special cases and conjectured that all DGPGs are
Sakamoto Yutaro
doaj +2 more sources
Hamilton cycles in 3‐out [PDF]
AbstractLet G3‐out denote the random graph on vertex set [n] in which each vertex chooses three neighbors uniformly at random. Note that G3‐out has minimum degree 3 and average degree 6. We prove that the probability that G3‐out is Hamiltonian goes to 1 as n tends to infinity. © 2009 Wiley Periodicals, Inc. Random Struct.
Tom Bohman, Alan Frieze
openalex +4 more sources
Reproductive Cycle of the Endangered Sarpunti, Puntius sarana (Hamilton, 1822) in Bangladesh
Successive developmental stages of both male and female gonads and estimation of gonado-somatic index (GSI) of Puntius sarana (Hamilton 1822) were investigated over a two year period (October 2002 to September 2004).
B.K. CHAKRABORTY +4 more
doaj +2 more sources
Colorful Hamilton cycles in random graphs
fixed minor ...
Debsoumya Chakraborti +2 more
openalex +4 more sources
Multicoloured Hamilton Cycles [PDF]
The edges of the complete graph $K_n$ are coloured so that no colour appears more than $\lceil cn\rceil$ times, where $c < 1/32$ is a constant. We show that if $n$ is sufficiently large then there is a Hamiltonian cycle in which each edge is a different colour, thereby proving a 1986 conjecture of Hahn and Thomassen. We prove a similar result for
Albert, Michael +2 more
openaire +2 more sources
Packing Hamilton Cycles Online [PDF]
It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge-disjoint Hamilton cycles [4, 9, 13]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ⩾ 2, if random edges of Kn are presented one by one then w.h.p.
Briggs, Joseph +4 more
openaire +4 more sources

