Integer sequence discovery from small graphs

DOI10.1016/j.dam.2015.07.017zbMath1329.05154arXiv1408.3644OpenAlexW1519873105WikidataQ39546733 ScholiaQ39546733MaRDI QIDQ908306

Anna Petrone, Travis Hoppe

Publication date: 4 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.3644

zbMATH Keywords

generatordatabaseinvariantinteger sequence

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items (1)

Integer sequence discovery from small graphs

Uses Software

• nauty
• NetworkX
• PuLP
• House of Graphs
• OEIS
• Traces
• bliss
• GraPHedron
• GENREG
• snarkhunter
• Triangleramsey
• Graph-tool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generation and properties of snarks
• Spectra of graphs
• Integer sequence discovery from small graphs
• Facet defining inequalities among graph invariants: The system graphedron
• House of Graphs: a database of interesting graphs
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10
• Practical graph isomorphism. II.
• Generating rooted and free plane trees
• Graph Theory and Probability
• Graph Invariants as Necessary Conditions for Global Constraints
• Fast generation of regular graphs and construction of cages
• Small graphs with chromatic number 5: A computer search
• A large database of graphs and its use for benchmarking graph isomorphism algorithms
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• The Generation of Fullerenes

This page was built for publication: Integer sequence discovery from small graphs