Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs
DOI10.1007/s10958-021-05350-1zbMath1464.05193arXiv1709.03218OpenAlexW3154442534MaRDI QIDQ2027316
Evgeniy Krasko, I. N. Labutin, Alexander Omelchenko
Publication date: 26 May 2021
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.03218
Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
- Hamiltonian circuits on the \(n\)-dimensional octahedron
- On the number of Hamiltonian cycles in Dirac graphs
- The maximum number of Hamiltonian paths in tournaments
- Enumeration of chord diagrams without loops and parallel chords
- On the Number of Hamiltonian Cycles in Bipartite Graphs
- On the Number of Hamiltonian Circuits in the n-Cube
- Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions
This page was built for publication: Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs
