Hamiltonian cycles in cayley color graphs

DOI10.1002/jgt.3190020108zbMath0381.05038OpenAlexW2048181522MaRDI QIDQ4159094

Joseph B. Klerlein

Publication date: 1978

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190020108

Mathematics Subject Classification ID

Geometric group theory (20F65) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

Graphs that admit square 1-factorizations are hamiltonian Cayley graphs, Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups), On hamiltonian circuits in Cayley diagrams, Enumeration of Hamiltonian paths in Cayley diagrams, On Hamiltonian circuits in Cartesian products of Cayley digraphs, A survey: Hamiltonian cycles in Cayley graphs, A survey: Hamiltonian cycles in Cayley graphs, Circulants and their connectivities, Cayley digraphs and (1,j,n)-sequencings of the alternating groups \(A_ n\)