Results 41 to 50 of about 55,873 (316)

Hamiltonian Cycles on Random Eulerian Triangulations

, 1998
A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead ...
Ambjorn, Ambjørn, Batchelor, Batchelor, Baxter, Blöte, Blöte, Blöte, C Kristjansen, David, David, David, Di Francesco, Di Francesco, Di Francesco, Di Francesco, Di Francesco, Di Francesco, Distler, Domany, Dotsenko, Duplantier, Duplantier, E Guitter, Eynard, Eynard, Golinelli, Gordon, Gujrati, Higuchi, J.L Nielsen, Knizhnik, Kondev, Kostov, Nienhuis, Orland, Schmalz, Shanks, Suzuki   +38 more
core   +2 more sources

Hamiltonian paths on Platonic graphs

International Journal of Mathematics and Mathematical Sciences, 2004
We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate
Brian Hopkins
doaj   +1 more source

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank [PDF]

, 2017
For even $k$, the matchings connectivity matrix $\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al.
Curticapean, Radu, Lindzey, Nathan, Nederlof, Jesper   +2 more
core   +3 more sources

Graphs with few hamiltonian cycles

Mathematics of Computation, 2019
29 pages; to appear in Mathematics of ...
Goedgebeur, Jan, Meersman, Barbara, Zamfirescu, Carol T.   +2 more
openaire   +3 more sources

Hamiltonian cycles in certain graphs [PDF]

Journal of the Australian Mathematical Society, 1978
AbstractIt is observed that arrays which arise in the scheduling of tournaments exist if and only if there are Hamiltonian cycles in certain graphs. The graphs are generalizations of those which arise in the “Footballers of Croam” problem. It is proven that such Hamiltonian cycles exist in infinite classes of the graphs.Subject classification (Amer ...
Katherine Heinrich, W. D. Wallis
openaire   +2 more sources

Long cycles in Hamiltonian graphs [PDF]

Israel Journal of Mathematics, 2018
15 pages, submitted, some typos ...
Teeradej Kittipassorn, Bhargav Narayanan, António Girão   +2 more
openaire   +3 more sources

A Theorem on Even Pancyclic Bipartite Digraphs

Mathematical Problems of Computer Science, 2021
We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj   +1 more source

A Survey on Hamiltonian Cycles

Interdisciplinary Information Sciences, 2001
The author surveys some of the classical results on Hamiltonian cycles in undirected graphs and pays particular attention to the development over the last decade. Among the subjects are: binding number, toughness, degree conditions, closure, regular graphs, and graphs on surfaces. This is intended as a supplement to the survey of \textit{R. J.
openaire   +4 more sources

Consolidate Overview of Ribonucleic Acid Molecular Dynamics: From Molecular Movements to Material Innovations

Advanced Engineering Materials, EarlyView.
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley   +1 more source

Small cycles in Hamiltonian graphs

Discrete Applied Mathematics, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ingo Schiermeyer, Uwe Schelten
openaire   +2 more sources