Results 91 to 100 of about 1,865,243 (219)
Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj +1 more source
Hamiltonian paths on 3-polytopes
AbstractThe smallest number of vertices, edges, or faces of any 3-polytope with no Hamiltonian path is determined. Similar results are found for simplicial polytopes with no Hamiltonian path.
openaire +2 more sources
Matching Lagrangian and Hamiltonian simulations in (2+1)-dimensional U(1) gauge theory
At finite lattice spacing, Lagrangian and Hamiltonian predictions differ due to discretization effects. In the Hamiltonian limit, i.e. at vanishing temporal lattice spacing $$a_t$$ a t , the path integral approach in the Lagrangian formalism reproduces ...
C. F. Groß +6 more
doaj +1 more source
Antidirected Hamiltonian paths in tournaments
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of antidirected Hamiltonian (ADH) paths in tournaments. We also prove that, in every tournament Tn with n ≥ 12, there is an ADH path starting at any vertex.
openaire +1 more source
Antidirected Hamiltonian paths in tournaments
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is established concerning the existence of antidirected Hamiltonian paths in tournaments.
openaire +2 more sources
Finite topologies and Hamiltonian paths
Suppose x is a finite set. This paper deals with the question of how many mutually complementary topologies X can carry. If p is a prime and |X|=p, p+1, 2p−1 or 2p, we prove that the answers are respectively p, p, 2p−1, 2p−1. The problem is shown to be related to the existence of a certain type of 1-factorization of the complete graph on an even number
openaire +1 more source
Hamiltonian paths in oriented graphs
AbstractA short proof is given of Meyniel's theorem on Hamiltonian cycles in oriented graphs. Analogous conditions are obtained for a graph to be Hamiltonianconnected.
openaire +2 more sources
Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem. [PDF]
Prohaska SJ +7 more
europepmc +1 more source
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
Zachary Abel +5 more
semanticscholar +1 more source

