Switching with more than two colours.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3547309 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3258082 (Why is no real title available?)
- scientific article; zbMATH DE number 3080680 (Why is no real title available?)
- Asymmetric graphs
- Cohomological aspects of two-graphs
- Reducts of the random graph
- The group of almost automorphisms of the countable universal graph
- The group of the countable universal graph
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
Cited in
(5)- Most switching classes with primitive automorphism groups contain graphs with trivial groups
- scientific article; zbMATH DE number 1390132 (Why is no real title available?)
- The \(r\)-switching-stable graphs
- scientific article; zbMATH DE number 3931042 (Why is no real title available?)
- Rainbow graphs and switching classes
This page was built for publication: Switching with more than two colours.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427966)