Related papers: Compact polymers on decorated square lattices
We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…
Given a family of graphs $G_1,\dots,G_{n}$ on the same vertex set $[n]$, a rainbow Hamilton cycle is a Hamilton cycle on $[n]$ such that each $G_c$ contributes exactly one edge. We prove that if $G_1,\dots,G_{n}$ are independent samples of…
The Hamiltonian Monte Carlo method generates samples by introducing a mechanical system that explores the target density. For distributions on manifolds it is not always simple to perform the mechanics as a result of the lack of global…
A graph \textit{G} is a tuple (\textit{V}, \textit{E}), where \textit{V} is the vertex set, \textit{E} is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree 2 on an…
A fullerene graph is a 3-connected cubic planar graph with pentagonal and hexagonal faces. The leapfrog transformation of a planar graph produces the trucation of the dual of the given graph. A fullerene graph is leapfrog if it can be…
The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ denotes the subspace of $C(G)$, spanned by the…
We have performed chain-growth simulations of minimalistic hybrid lattice models for polymers interacting with interfaces of attractive solid substrates in order to gain insights into the conformational transitions of the polymers in the…
Investigating a problem of B. Mohar, we show that every one-ended Hamiltonian cubic graph with end degree 3 contains a second Hamilton cycle. We also construct two examples showing that this result does not extend to give a third Hamilton…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
We consider how many random edges need to be added to a graph of order $n$ with minimum degree $\alpha n$ in order that it contains the square of a Hamilton cycle w.h.p..
We introduce and analyze a model for the transport of particles or energy in extended lattice systems. The dynamics of the model acts on a discrete phase space at discrete times but has nonetheless some of the characteristic properties of…
We prove that if an $n$-vertex graph with minimum degree at least $3$ contains a Hamiltonian cycle, then it contains another cycle of length $n-o(n)$; this implies, in particular, that a well-known conjecture of Sheehan from 1975 holds…
We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…
We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…
An integrable Hamiltonian system presents monodromy if the action-angle variables cannot be defined globally. As a prototype of classical monodromy with azimuthal symmetry, we consider a linear molecule interacting with external fields and…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.