Cycle regular graphs need not be transitive

DOI10.1016/S0166-218X(00)00292-4zbMath0990.05086OpenAlexW2090696905MaRDI QIDQ5951968

Jean-Luc Fouquet, Geňa Hahn

Publication date: 2001

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00292-4

zbMATH Keywords

cycle regular graphs

Mathematics Subject Classification ID

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

Related Items (3)

Distinguishing graphs via cycles ⋮ Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn ⋮ Sense of direction in distributed computing

Cites Work

• Unnamed Item
• On edge but not vertex transitive regular graphs
• Regular line-symmetric graphs
• Section graphs for finite permutation groups
• An Edge but not Vertex Transitive Cubic Graph^*

This page was built for publication: Cycle regular graphs need not be transitive