Results 41 to 50 of about 3,139,455 (314)
Hamiltonian cycles in k‐partite graphs [PDF]
Journal of Graph Theory, 2019 AbstractChen et al determined the minimum degree threshold for which a balanced ‐partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary ‐partite graphs in that all parts have at most vertices (a necessary condition).
Louis DeBiasio +3 more
openaire +3 more sources
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
On Extremal Hypergraphs for Hamiltonian Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2011 We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur n- and Dirac-type results. While the Tur n-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely ...
Glebov, Roman, Person, Yury, Weps, Wilma
openaire +3 more sources
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle
Journal of Optimization, 2018 Hamiltonian Cycle Problem is one of the most explored combinatorial problems. Being an NP-complete problem, heuristic approaches are found to be more powerful than exponential time exact algorithms.
K. R. Seeja
semanticscholar +1 more source
Hamiltonian Normal Cayley Graphs
Discussiones Mathematicae Graph Theory, 2019 A variant of the Lovász Conjecture on hamiltonian paths states that every finite connected Cayley graph contains a hamiltonian cycle. Given a finite group G and a connection set S, the Cayley graph Cay(G, S) will be called normal if for every g ∈ G we ...
Montellano-Ballesteros Juan José +1 more
doaj +1 more source
Enforced hamiltonian cycles in generalized dodecahedra
Electronic Journal of Graph Theory and Applications, 2013 The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle.
Maria Timkova
doaj +1 more source
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Nishiyama, Hiroshi +4 more
openaire +3 more sources
CONTRACTIBLE HAMILTONIAN CYCLES IN POLYHEDRAL MAPS [PDF]
Discrete Mathematics, Algorithms and Applications, 2012 We present a necessary and sufficient condition for existence of a contractible Hamiltonian cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to find such cycles (if they exist). This is further generalized and shown to hold for more general maps.
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +2 more sources