Results 11 to 20 of about 55,873 (316)
Counting Hamiltonian Cycles in 2-Tiled Graphs
Mathematics, 2021 In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface.
Alen Vegi Kalamar +2 more
doaj +1 more source
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
Hamiltonian Cycles in T-Graphs [PDF]
Discrete & Computational Geometry, 2000 The vertices and polygonal edges of the planar Archimedean tiling \(3^6\) of the plane is called the triangular tiling graph (TTG). A subgraph \(G\) of TTG is linearly convex if, for every line \(L\) which contains an edge of TTG, the set \(L \cap G\) is a (possibly degenerated or empty) line segment.
Tudor Zamfirescu, John R. Reay
openaire +3 more sources
Hamiltonian Cycles in Cayley Graphs of Gyrogroups
Mathematics, 2022 In this study, we investigate Hamiltonian cycles in the right-Cayley graphs of gyrogroups. More specifically, we give a gyrogroup version of the factor group lemma and show that some right-Cayley graphs of certain gyrogroups are Hamiltonian.
Rasimate Maungchang +3 more
doaj +1 more source
Discrete Mathematics, 2022 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Vaidy Sivaraman, Thomas Zaslavsky
openaire +2 more sources
Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles [PDF]
Opuscula Mathematica, 2019 We use the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph. A decomposition of complete \(k\)-uniform hypergraph \(K^{(k)}_{n}\) into Hamiltonian cycles was studied by Bailey-Stevens and Meszka-Rosa. For \(n\equiv 2,4,5\pmod 6\)
Meihua, Meiling Guan, Jirimutu
doaj +1 more source
Hamiltonian cycles on bicolored random planar maps
Nuclear Physics B, 2023 We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central charges c=−1 ...
Bertrand Duplantier +2 more
doaj +1 more source
Hamiltonian Chains in Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Hamiltionian chain is a generalisation of hamiltonian cycles for hypergraphs. Among the several possible ways of generalisations this is probably the most strong one, it requires the strongest structure.
Gyula Y. Katona
doaj +1 more source
Hamiltonian paths and cycles in hypertournaments [PDF]
Journal of Graph Theory, 1997 If \(n\) and \(k\) are integers, \(n \geq k > 1\), a \(k\)-hypertournament \(T\) on \(n\) vertices consists of a set \(V\) of vertices, where \(|V|= n\), and a set \(A\) of \(k\)-tuples (``arcs'') of vertices such that for any \(k\)-subset \(S\) of \(V\), \(A\) contains exactly one of the \(k\)! \(k\)-tuples whose entries belong to \(S\). Note that a 2-
Gutin, Gregory, Yeo, A.
openaire +11 more sources
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 ...
Wilma Weps, Roman Glebov, Yury Person
openaire +4 more sources