House of Graphs: A database of interesting graphs

Brinkmann, Gunnar; Coolsaet, Kris; Goedgebeur, Jan; Mélot, Hadrien

Request a copy

Article (Scientific journals)

House of Graphs: A database of interesting graphs

Brinkmann, Gunnar; Coolsaet, Kris; Goedgebeur, Jan et al.

2013 • In Discrete Applied Mathematics, 161, p. 311-314

Peer Reviewed verified by ORBi

Permalink
https://hdl.handle.net/20.500.12907/28128

Files (1)Send to Details Statistics Bibliography Similar publications

Files

Full Text

HoG_AsPublished.pdf

Publisher postprint (177.23 kB)

Request a copy

All documents in ORBi UMONS are protected by a user license.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Research center :

CREMMI - Modélisation mathématique et informatique

Disciplines :

Electrical & electronics engineering
Mathematics

Author, co-author :

Brinkmann, Gunnar

Coolsaet, Kris

Goedgebeur, Jan

Mélot, Hadrien ; Université de Mons > Faculté des Sciences > Algorithmique

Language :

English

Title :

House of Graphs: A database of interesting graphs

Publication date :

01 January 2013

Journal title :

Discrete Applied Mathematics

ISSN :

0166-218X

eISSN :

1872-6771

Publisher :

Elsevier, Amsterdam, Netherlands

Volume :

161

Pages :

311-314

Peer reviewed :

Peer Reviewed verified by ORBi

Research unit :

S825 - Algorithmique

Research institute :

R300 - Institut de Recherche en Technologies de l'Information et Sciences de l'Informatique
R150 - Institut de Recherche sur les Systèmes Complexes

Available on ORBi UMONS :

since 25 October 2012

Statistics

Number of views

21 (0 by UMONS)

Number of downloads

0 (0 by UMONS)

More statistics

Scopus citations^®

130

Scopus citations^®
without self-citations

Bibliography

S. Brandt, G. Brinkmann, T. Harmuth, All Ramsey numbers r(K3, G) for connected graphs of order 9, Electronic Journal of Combinatorics 5 (1) (1998).
S. Brandt, G. Brinkmann, T. Harmuth, The generation of maximal triangle-free graphs, Graphs and Combinatorics 16 (2) (2000) 149-157.
G. Brinkmann, Fast generation of cubic graphs, Journal of Graph Theory 23 (2) (1996) 139-149.
G. Brinkmann, J. Goedgebeur, B.D. McKay, Generation of cubic graphs, Discrete Mathematics and Theoretical Computer Science 13 (2) (2011) 69-80.
http://cs.anu.edu.au/∼bdm/data/.
http://mapleta.maths.uwa.edu.au/∼gordon/.
http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html.
http://www.maths.gla.ac.uk/∼es/.
http://www.theory.cs.uvic.ca/∼cos/.
G. Li, F. Ruskey, The advantages of forward thinking in generating rooted and free trees, in: 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 1999, pp. 939-940.
B.D. McKay, Isomorph-free exhaustive generation, Journal of Algorithms 26 (1998) 306-324.
H. Mélot, Facet defining inequalities among graph invariants: the system GraPHedron, Discrete Applied Mathematics 156 (2008) 1875-1891.
M. Meringer, Fast generation of regular graphs and construction of cages, Journal of Graph Theory 30 (2) (1999) 137-146.
A. Peeters, K. Coolsaet, G. Brinkmann, N. Van Cleemput, V. Fack, Grinvin in a nutshell, Journal of Mathematical Chemistry 45 (2) (2009) 471-477. in: Conference on 20 Years of Molecular Topology in Cluj.
H.E. Pence, A. Williams, Chemspider: an online chemical information resource, Journal of Chemical Education 87 (2010) 1123-1124. http://www.chemspider.com.
R.C. Read, R.J. Wilson, An Atlas of Graphs, Oxford Science Publications, 1998, ISBN: 0-19-825650-4.
N. Sloane, The on-line encyclopedia of integer sequences, https://oeis.org/.