Computeralgebra and the systematic construction of finite unlabeled structures
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Applications of graph theory (05C90) Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Linear codes (general theory) (94B05)
Recommendations
Cited in
(7)- Group actions, double cosets, and homomorphisms: Unifying concepts for the constructive theory of discrete structures
- Applied finite group actions.
- Finite structures, their theory, their construction, and applications
- Constructing finite unlabeled structures using group actions
- scientific article; zbMATH DE number 49672 (Why is no real title available?)
- scientific article; zbMATH DE number 1522756 (Why is no real title available?)
- scientific article; zbMATH DE number 1440119 (Why is no real title available?)
This page was built for publication: Computeralgebra and the systematic construction of finite unlabeled structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702015)