Results 1 to 10 of about 33,701 (288)
Identifying Hamilton cycles in the Cartesian product of directed cycles [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 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]
Journal of Combinatorial Theory, Series B, 2007 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]
Discrete Mathematics, 2017 published in Discrete ...
Zan‐Bo Zhang, Yueping Li, Dingjun Lou
openalex +3 more sources
Hamilton Cycles in Double Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2019 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]
Random Structures & Algorithms, 2009 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
Colorful Hamilton cycles in random graphs
SIAM Journal on Discrete Mathematics, 2021 fixed minor ...
Debsoumya Chakraborti +2 more
openalex +4 more sources
Multicoloured Hamilton Cycles [PDF]
The Electronic Journal of Combinatorics, 1995 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
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +1 more source
Deformation and damage capacity of thin–walled rods and tubular conduits under alternating loading [PDF]
E3S Web of Conferences, 2023 The paper presents deformation and elastoplastic calculation of thin–walled rods (pipelines) under spatial – alternating loading taking into account damageability of material.
Abdusattarov Abdusamat +2 more
doaj +1 more source