A note on Frucht diagrams, Boolean graphs and Hamilton cycles

DOI10.1016/0012-365X(93)90361-VzbMath0795.05082MaRDI QIDQ685668

W. Cedeño, Victor Jauregui, Italo Jose Dejter

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphgroup actionsHamiltonian cyclesBoolean graphsFrucht diagrams

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items

On generalized middle-level problem, Boolean layer cakes

Cites Work

• Two Hamilton cycles in bipartite reflective Kneser graphs
• HOW TO DESCRIBE A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item