Switching with more than two colours.

DOI10.1016/S0195-6698(03)00097-0zbMath1033.05038OpenAlexW2044595066MaRDI QIDQ1427966

Sam Tarzi, Peter J. Cameron

Publication date: 14 March 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(03)00097-0

zbMATH Keywords

random graphsswitching classswitching automorphismsswitching group

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Cohomological aspects of two-graphs
• The group of the countable universal graph
• Reducts of the random graph
• The group of almost automorphisms of the countable universal graph
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Asymmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Switching with more than two colours.