Results 41 to 50 of about 154,862 (311)
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 AbstractA geometric graph is a graph embedded in the plane in such a way that vertices correspond to points in general position and edges correspond to segments connecting the appropriate points. A noncrossing Hamiltonian path in a geometric graph is a Hamiltonian path which does not contain any intersecting pair of edges.
Jakub erný +3 more
openaire +2 more sources
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Theory and Applications of Graphs, 2021 The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
The Hamiltonian problem and t-path traceable graphs [PDF]
Involve, a Journal of Mathematics, 2017 12 pages, 4 ...
Bari, Kashif, O’Sullivan, Michael
openaire +5 more sources
A Hofer-Type Norm of Hamiltonian Maps on Regular Poisson Manifold
Journal of Applied Mathematics, 2014 We define a Hofer-type norm for the Hamiltonian map on regular Poisson manifold and prove that it is nondegenerate. We show that the L1,∞-norm and the L∞-norm coincide for the Hamiltonian map on closed regular Poisson manifold and give some sufficient ...
Dawei Sun, Zhenxing Zhang
doaj +1 more source
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Моделирование и анализ информационных систем, 2021 We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +1 more source
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + 1 holds for any triple of independent vertices u, v and w. Then for any distinct vertices u and v such that {u, v} is not a cut vertex set of G, there is a hamiltonian path between u and v.
openaire +2 more sources
SU(2) QCD in the Path Representation: General Formalism and Mandelstam Indentities
, 1993 We introduce a path-dependent hamiltonian representation (the path representation) for SU(2) with fermions in 3 + 1 dimensions. The gauge-invariant operators and hamiltonian are realized in a Hilbert space of open path and loop functionals. We obtain two
Aroca +29 more
core +2 more sources
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Triangle-different Hamiltonian paths
Journal of Combinatorial Theory, Series B, 2018 Let $G$ be a fixed graph. Two paths of length $n-1$ on $n$ vertices (Hamiltonian paths) are $G$-different if there is a subgraph isomorphic to $G$ in their union. In this paper we prove that the maximal number of pairwise triangle-different Hamiltonian paths is equal to the number of balanced bipartitions of the ground set, answering a question of K ...
István Kovács, Daniel Soltész
openaire +3 more sources