Enumerating graphs via even/odd dichotomy
From MaRDI portal
Publication:1671341
DOI10.1016/j.dam.2018.03.047zbMath1394.05058OpenAlexW2799884971WikidataQ114191518 ScholiaQ114191518MaRDI QIDQ1671341
Klavdija Kutnar, Dragan Marušič, Ademir Hujdurović
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.047
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of vertex-transitive graphs of fixed valency
- Cayley numbers with arbitrarily many distinct prime factors
- Symmetry structure of bicirculants
- On vertex symmetric digraphs
- The Magma algebra system. I: The user language
- On vertex-transitive, non-Cayley graphs of order \(pqr\)
- On vertex-transitive graphs of odd prime-power order
- Cayley graphs on abelian groups
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
- The transitive groups of degree twelve
- On isomorphisms of finite Cayley graphs---a survey
- Enumeration of Cayley graphs and digraphs
- On non-Cayley vertex-transitive graphs of order a product of three primes
- Kombinatorische Anzahlbestimmungen in Relationen
- Nilpotent Numbers
- Odd automorphisms in vertex-transitive graphs
- Characterizing vertex-transitivepq-graphs with an imprimitive automorphism subgroup
- Vertex-transitive graphs that are not Cayley graphs. II
- Point-symmetric graphs with a prime number of points
- The Number of Linear, Directed, Rooted, and Connected Graphs
This page was built for publication: Enumerating graphs via even/odd dichotomy
