Section graphs for finite permutation groups
From MaRDI portal
Cited in
(8)- On semigroups of graph endomorphisms
- Tournaments with given (infinite) automorphism group
- Large sets of pseudosimilar vertices
- Perfect refiners for permutation group backtracking algorithms
- Representability of permutation representations on coalgebras and the isomorphism problem
- On a conjecture concerning the reconstruction of graphs
- Cycle regular graphs need not be transitive
- Realization of permutation modules via Alexandroff spaces
This page was built for publication: Section graphs for finite permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5562635)