Section graphs for finite permutation groups

From MaRDI portal

Revision as of 03:36, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5562635

Jump to:navigation, search

DOI10.1016/S0021-9800(69)80034-7zbMath0174.30904MaRDI QIDQ5562635

I. Z. Bouwer

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

Related Items (7)

Perfect refiners for permutation group backtracking algorithms ⋮ Large sets of pseudosimilar vertices ⋮ On semigroups of graph endomorphisms ⋮ Representability of permutation representations on coalgebras and the isomorphism problem ⋮ Cycle regular graphs need not be transitive ⋮ Tournaments with given (infinite) automorphism group ⋮ On a conjecture concerning the reconstruction of graphs

This page was built for publication: Section graphs for finite permutation groups

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5562635&oldid=30173402"