Constructive enumeration of graphs
From MaRDI portal
Publication:3770567
DOI10.1017/S0004972700027398zbMATH Open0633.05034OpenAlexW2091829451MaRDI QIDQ3770567FDOQ3770567
Authors: Gordon Royle
Publication date: 1988
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700027398
algorithmCayley graphscubic graphsvertex-transitive graphsconstructionCAYLEYnumerical informationgroup theoretic software
Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Further restrictions on the structure of finite CI-groups
- On a class of linked diagrams. I: Enumeration
- On Operator and Formal Sum Methods for Graph Enumeration Problems
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- Enumeration of simple complete topological graphs
- Further restrictions on the structure of finite DCI-groups: an addendum
- Structure of the set of generating graphs in the theory of pseudocriteria
- The shrinking-and-expanding method for the graph enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-Abelian finite groups whose character sums are invariant but are not Cayley isomorphism
- Enumeration of hypergraphs. I
- Title not available (Why is that?)
This page was built for publication: Constructive enumeration of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770567)