Sets with involutions: power group enumeration
From MaRDI portal
Publication:976166
DOI10.1016/j.ejc.2009.12.005zbMath1227.05042OpenAlexW2071511399MaRDI QIDQ976166
Publication date: 17 June 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.12.005
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A contribution to the theory of voltage graphs
- Une théorie combinatoire des séries formelles
- Isomorphisms and automorphisms of graph coverings
- The topological theory of current graphs
- Generating all graph coverings by permutation voltage assignments
- Applied finite group actions.
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- Voltage graphs
- Isomorphism Classes of Concrete Graph Coverings
- Isomorphism Classes of Graph Bundles
- Enumeration of Concrete Regular Covering Projections
- The power group enumeration theorem
- A Census of Finite Automata
- Enumeration of finite automata
- The Number of Linear, Directed, Rooted, and Connected Graphs
This page was built for publication: Sets with involutions: power group enumeration