Cycle regular graphs need not be transitive

DOI10.1016/S0166-218X(00)00292-4MaRDI QIDQ5951968zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3745208 (Why is no real title available?)
• An Edge but not Vertex Transitive Cubic Graph^*
• On edge but not vertex transitive regular graphs
• Regular line-symmetric graphs
• Section graphs for finite permutation groups

Cited in

(4)

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

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

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