Results 1 to 10 of about 83 (71)
A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps
Electronic Journal of Graph Theory and Applications, 2014 We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj +5 more sources
Applicable Analysis and Discrete Mathematics, 2019 In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this time letting n grow while m is fixed.
Olga Bodroža-Pantić, Milan Pantic
exaly +6 more sources
Classification of Hamiltonian Cycles of a 3-Connected Graph Which Contain Five Contractible Edges
SUT Journal of Mathematics, 2000 Summary: We classify all pairs \((G,C)\) of a 3-connected graph \(G\) of order at least 16 and a longest cycle \(C\) of \(G\) such that \(C\) contains precisely five contractible edges of \(G\).
Keiko Kotani
exaly +5 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.
Dipendu Maity, Ashish Kumar Upadhyay
openaire +3 more sources
Contractible edges in longest cycles in non-Hamiltonian graphs
Discrete Mathematics, 1994 This paper addresses the question of how contractible edges are distributed in longest cycles in 3-connected graphs. It establishes the fact that in non-Hamiltonian 3-connected graphs, each longest cycle includes at least 6 contractible edges. An edge in a 3-connected graph is called contractible if the graph obtained from the contraction of the edge ...
M N Ellingham
exaly +2 more sources
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Olga Bodroža-Pantić +2 more
doaj +1 more source
Contractible Hamiltonian cycles in triangulated surfaces [PDF]
Elemente der Mathematik, 2014 A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a ...
openaire +3 more sources
Hamiltonian Floer theory on surfaces
, 2021 Dans cette thèse, nous développons de nouveaux outils pour relier les dynamiques qualitatives des systèmes hamiltoniens sur des surfaces aux propriétés algèbriques de leurs complexes de Floer - un objet algébrique qui encode l'information sur la façon ...
Connery-Grigg, Dustin
core +1 more source
A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs
Discussiones Mathematicae Graph Theory, 2018 We continue our research in the enumeration of Hamiltonian cycles (HCs) on thin cylinder grid graphs Cm × Pn+1 by studying a triangular variant of the problem. There are two types of HCs, distinguished by whether they wrap around the cylinder.
Bodroža-Pantić Olga +3 more
doaj +1 more source
Classification of Hamiltonian Cycles of a 3-Connected Graph Which Contain Five Contractible Edges
Classification of Hamiltonian Cycles of a 3-Connected Graph Which Contain Five Contractible Edgesフジタ, キョウ +5 more
openaire +1 more source