On Cayley digraphs that do not have Hamiltonian paths
From MaRDI portal
Publication:2248717
DOI10.1155/2013/725809zbMath1295.05120arXiv1306.5443OpenAlexW2107465763WikidataQ58923552 ScholiaQ58923552MaRDI QIDQ2248717
Publication date: 27 June 2014
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5443
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Cayley digraphs of prime-power order are hamiltonian
- Enumeration of Hamiltonian paths in Cayley diagrams
- Partial products in finite groups
- Paths and circuits in finite groups
- Hamiltonian cycles in Cayley graphs whose order has few prime factors
- On non-Hamiltonian circulant digraphs of outdegree three
- 2-generated Cayley digraphs on nilpotent groups have hamiltonian paths
This page was built for publication: On Cayley digraphs that do not have Hamiltonian paths