Results 41 to 50 of about 445,337 (327)
Counting Hamilton Cycles in Dirac Hypergraphs
Combinatorica, 2023 AbstractFor $$0\le \ell <k$$ 0 ≤ ℓ < k , a Hamilton $$\ell $$ ℓ -cycle in a k-uniform hypergraph H is a cyclic ordering of the vertices of H in which the edges ...
Ferber, Asaf, Hardiman, Liam, Mond, Adva
openaire +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 uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
Path separation by short cycles
, 2016 Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any pair of paths ...
Cibulka +9 more
core +1 more source
A Note on Barnette’s Conjecture
Discussiones Mathematicae Graph Theory, 2013 Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c ...
Harant Jochen
doaj +1 more source
Cards of fixed points of some Lotka-Volterra operators [PDF]
E-Journal of Analysis and Applied MathematicsThe paper considers a special type of the Lotka-Volterra operator operating in a four-dimensional simplex. The tournament corresponding to this operator has four cyclic triples. All kinds of fixed point cards are built for it. It is proved which types of
Dilfuza B. Eshmamatova +1 more
doaj +1 more source
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms, 2021 AbstractWe prove that a random graph , with p above the Hamiltonicity threshold, is typically such that for any r‐coloring of its edges there exists a Hamilton cycle with at least edges of the same color. This estimate is asymptotically optimal.
Gishboliner, Lior +2 more
openaire +2 more sources
Parameterized TSP: Beating the Average [PDF]
, 2014 In the Travelling Salesman Problem (TSP), we are given a complete graph $K_n$ together with an integer weighting $w$ on the edges of $K_n$, and we are asked to find a Hamilton cycle of $K_n$ of minimum weight.
Gutin, Gregory, Patel, Viresh
core
Advanced Engineering Materials, EarlyView.The results demonstrate a simulation‐driven workflow that applies LSB topology optimization with additive manufacturing constraints to mission‐specific load cases, integrating European Cooperation for Space Standardization compliant verification and manufacturability to develop structurally efficient rover suspension components.
Stelios K. Georgantzinos +11 more
wiley +1 more source
Notes on sufficient conditions for a graph to be Hamiltonian
International Journal of Mathematics and Mathematical Sciences, 1991 The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is related to a result often referred to as the Ghouila-Houri Theorem.
Michael Joseph Paul +2 more
doaj +1 more source