Results 1 to 10 of about 82 (68)
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
Edge Disjoint Hamilton Cycles in Knödel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The vertices of the Knödel graph $W_{\Delta, n}$ on $n \geq 2$ vertices, $n$ even, and of maximum degree $\Delta, 1 \leq \Delta \leq \lfloor log_2(n) \rfloor$, are the pairs $(i,j)$ with $i=1,2$ and $0 \leq j \leq \frac{n}{2} -1$.
Palanivel Subramania Nadar Paulraja +1 more
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
Finding Hamilton cycles in random intersection graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
Have Business Cycles Become More Synchronous After NAFTA?
American Business Review, 2021 Trade agreements do not necessitate business cycle comovement. Focusing on NAFTA, we investigate whether business cycles in Canada, Mexico, and the US have become more synchronous after the landmark trade agreement came into effect in 1994.
Puneet Vatsa
doaj +1 more source
Identifying Hamilton cycles in the Cartesian product of directed cycles
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 +1 more source
Finding Hamilton cycles in robustly expanding digraphs
Journal of Graph Algorithms and Applications, 2012 We provide an NC algorithm for finding Hamilton cycles in directed graphs with a certain robust expansion property. This property captures several known criteria for the existence of Hamilton cycles in terms of the degree sequence and thus we provide ...
Demetres Christofides +3 more
doaj +1 more source
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Hamilton Cycles in Restricted and Incomplete Rotator Graphs
Journal of Graph Algorithms and Applications, 2012 The nodes of a rotator graph are the permutations of n, and an arc is directed from u to v if the first r symbols of u can be rotated one position to the left to obtain v. Restricted rotator graphs restrict the allowable rotations to r ∈ R for some R ⊆
Brett Stevens, Aaron Williams
doaj +1 more source
A Note on Cycles in Locally Hamiltonian and Locally Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 Let 𝒫 be a property of a graph. A graph G is said to be locally 𝒫, if the subgraph induced by the open neighbourhood of every vertex in G has property 𝒫. Ryjáček conjectures that every connected, locally connected graph is weakly pancyclic.
Tang Long, Vumar Elkin
doaj +1 more source