Hamiltonian cycles in cayley color graphs

DOI10.1002/JGT.3190020108zbMATH Open0381.05038OpenAlexW2048181522MaRDI QIDQ4159094FDOQ4159094

Authors: 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

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

Cited In (9)

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

This page was built for publication: Hamiltonian cycles in cayley color graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159094)