Nowhere-zero flows in low genus graphs. - Martina Möller; Hans Georg Carstens; Gunnar Brinkmann (J. Graph Theory, 1988)

The Smallest Cubic Graphs of Girth Nine. - Gunnar Brinkmann; Brendan D. McKay; Carsten Saager (Comb. Probab. Comput., 1995)

Fast generation of cubic graphs. - Gunnar Brinkmann (J. Graph Theory, 1996)

3- and 4-critical graphs of small even order. - Gunnar Brinkmann; Eckhard Steffen (Discret. Math., 1997)

A Constructive Enumeration of Fullerenes. - Gunnar Brinkmann; Andreas W. M. Dress (J. Algorithms, 1997)

Topological Resonance Energy of Fullerenes. - Darko Babic; Gunnar Brinkmann; Andreas W. M. Dress (J. Chem. Inf. Comput. Sci., 1997)

Two applications of the Divide&Conquer principle in the molecular sciences. - Gunnar Brinkmann; Andreas W. M. Dress; Sören Perrey; Jens Stoye (Math. Program., 1997)

Isomorphism rejection in structure generation programs. - Gunnar Brinkmann (Discrete Mathematical Chemistry, 1998)

Snarks and Reducibility. - Gunnar Brinkmann; Eckhard Steffen (Ars Comb., 1998)

All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. - Stephan Brandt; Gunnar Brinkmann; Thomas Harmuth (Electron. J. Comb., 1998)

All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. - Gunnar Brinkmann (Comb. Probab. Comput., 1998)

Chromatic-Index-Critical Graphs of Orders 11 and 12. - Gunnar Brinkmann; Eckhard Steffen (Eur. J. Comb., 1998)

Spiral Coding of Leapfrog Polyhedra. - Gunnar Brinkmann; Patrick W. Fowler (J. Chem. Inf. Comput. Sci., 1998)

Fast generation of some classes of planar graphs. - Gunnar Brinkmann; Brendan D. McKay (Electron. Notes Discret. Math., 1999)

Fast generation of nanotube caps. - Gunnar Brinkmann; Ulrike von Nathusius; A. H. R. Palser (Electron. Notes Discret. Math., 1999)

Patches with minimal boundary length. - Juliane Greinus; Gunnar Brinkmann (Electron. Notes Discret. Math., 1999)

Counting Symmetric Configurations v3. - Anton Betten; Gunnar Brinkmann; Tomaz Pisanski (Discret. Appl. Math., 2000)

The Generation of Maximal Triangle-Free Graphs. - Stephan Brandt; Gunnar Brinkmann; Thomas Harmuth (Graphs Comb., 2000)

Lists of Face-Regular Polyhedra. - Gunnar Brinkmann; Michel Deza (J. Chem. Inf. Comput. Sci., 2000)

Numbers of Faces and Boundary Encodings of Patches. - Gunnar Brinkmann; Olaf Delgado-Friedrichs; Ulrike von Nathusius (Graphs and Discovery, 2001)

A constructive enumeration of nanotube cap. - Gunnar Brinkmann; Ulrike von Nathusius; A. H. R. Palser (Discret. Appl. Math., 2002)

Resonance graphs of catacondensed even ring systems are median. - Sandi Klavzar; Petra Zigert; Gunnar Brinkmann (Discret. Math., 2002)

A constructive enumeration of fusenes and benzenoids. - Gunnar Brinkmann; Gilles Caporossi; Pierre Hansen (J. Algorithms, 2002)

Posets on up to 16 Points. - Gunnar Brinkmann; Brendan D. McKay (Order, 2002)

The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. - Gunnar Brinkmann; Thomas Harmuth; Oliver Heidemeier (Discret. Appl. Math., 2003)

Pentagon-hexagon-patches with short boundaries. - Jörn Bornhöft; Gunnar Brinkmann; Juliane Greinus (Eur. J. Comb., 2003)

A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons. - Gunnar Brinkmann; Gilles Caporossi; Pierre Hansen (J. Chem. Inf. Comput. Sci., 2003)

A Catalogue of Growth Transformations of Fullerene Polyhedra. - Gunnar Brinkmann; Patrick W. Fowler (J. Chem. Inf. Comput. Sci., 2003)

A Catalogue of Isomerization Transformations of Fullerene Polyhedra. - Gunnar Brinkmann; Patrick W. Fowler; C. Justus (J. Chem. Inf. Comput. Sci., 2003)

To be or not to be Yutsis: Algorithms for the decision problem. - Dries Van Dyck; Gunnar Brinkmann; Veerle Fack; Brendan D. McKay (Comput. Phys. Commun., 2005)

Chromatic-index-critical graphs of orders 13 and 14. - Drago Bokal; Gunnar Brinkmann; Stefan Grünewald (Discret. Math., 2005)

Generation of simple quadrangulations of the sphere. - Gunnar Brinkmann; Sam Greenberg; Catherine S. Greenhill; Brendan D. McKay; Robin Thomas 001; Paul Wollan (Discret. Math., 2005)

Construction of planar triangulations with minimum degree 5. - Gunnar Brinkmann; Brendan D. McKay (Discret. Math., 2005)

GrInvIn for graph theory teaching and research. - Adriaan Peeters; Kris Coolsaet; Gunnar Brinkmann; Nicolas Van Cleemput; Veerle Fack (CTW, 2007)

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. - Mustapha Aouchiche; Gunnar Brinkmann; Pierre Hansen (Discret. Appl. Math., 2008)

NANOCONES - A Classification Result in Chemistry. - Gunnar Brinkmann; Nicolas Van Cleemput (CTW, 2009)

Graph structural properties of non-Yutsis graphs allowing fast recognition. - Robert E. L. Aldred; Dries Van Dyck; Gunnar Brinkmann; Veerle Fack; Brendan D. McKay (Discret. Appl. Math., 2009)

Rehabilitation of an unloved child: semi-splaying. - Gunnar Brinkmann; Jan Degraer; Karel De Loof (Softw. Pract. Exp., 2009)

Classification and generation of nanocones. - Gunnar Brinkmann; Nicolas Van Cleemput (Discret. Appl. Math., 2011)

Generation of Cubic graphs. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (Discret. Math. Theor. Comput. Sci., 2011)

A Database of Interesting Graphs: The House of Graphs. - Gunnar Brinkmann; Kris Coolsaet; Jan Goedgebeur; Hadrien Mélot (CTW, 2012)

Snarks with Total Chromatic Number 5. - Gunnar Brinkmann; Simone Dantas; Celina M. H. de Figueiredo; Myriam Preissmann; Diana Sasaki (CTW, 2012)

Ramsey Numbers R(K3, G) for Graphs of Order 10. - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (Electron. J. Comb., 2012)

Ramsey numbers R(K3,G) for graphs of order 10 - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (CoRR, 2012)

α-Labelings and the Structure of Trees with Nonzero α-Deficit. - Gunnar Brinkmann; Simon Crevals; Hadrien Mélot; Leanne Rylands; Eckhard Steffen (Discret. Math. Theor. Comput. Sci., 2012)

The Generation of Fullerenes. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (J. Chem. Inf. Model., 2012)

An independent set approach for the communication network of the GPS III system. - Gunnar Brinkmann; Simon Crevals; John Frye (Discret. Appl. Math., 2013)

House of Graphs: A database of interesting graphs. - Gunnar Brinkmann; Kris Coolsaet; Jan Goedgebeur; Hadrien Mélot (Discret. Appl. Math., 2013)

Generating regular directed graphs. - Gunnar Brinkmann (Discret. Math., 2013)

Generation and properties of snarks. - Gunnar Brinkmann; Jan Goedgebeur; Jonas Hägglund; Klas Markström (J. Comb. Theory B, 2013)

Generation of various classes of trivalent graphs. - Gunnar Brinkmann; Nicolas Van Cleemput; Tomaz Pisanski (Theor. Comput. Sci., 2013)

Construction of planar 4-connected triangulations. - Gunnar Brinkmann; Craig E. Larson; Jasper Souffriau; Nico Van Cleemput (Ars Math. Contemp., 2015)

Snarks with total chromatic number 5. - Gunnar Brinkmann; Myriam Preissmann; Diana Sasaki (Discret. Math. Theor. Comput. Sci., 2015)

On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations. - Gunnar Brinkmann; Jasper Souffriau; Nico Van Cleemput (J. Graph Theory, 2016)

Generation of Cubic Graphs and Snarks with Large Girth. - Gunnar Brinkmann; Jan Goedgebeur (J. Graph Theory, 2017)

On the number of hamiltonian cycles in triangulations with few separating triangles. - Gunnar Brinkmann; Jasper Souffriau; Nico Van Cleemput (J. Graph Theory, 2018)

Generation of Union-Closed Sets and Moore Families. - Gunnar Brinkmann; Robin Deklerck (J. Integer Seq., 2018)

Types of triangle in Hamiltonian triangulations and an application to domination and k-walks. - Gunnar Brinkmann; Kenta Ozeki; Nico Van Cleemput (Ars Math. Contemp., 2019)

Polyhedra with Few 3-Cuts are Hamiltonian. - Gunnar Brinkmann; Carol T. Zamfirescu (Electron. J. Comb., 2019)

Patches with short boundaries. - Gunnar Brinkmann; Simon Van den Eynde (Eur. J. Comb., 2019)

Grinberg's Criterion. - Gunnar Brinkmann; Carol T. Zamfirescu (Eur. J. Comb., 2019)

A simple and elementary proof of Whitney's unique embedding theorem. - Gunnar Brinkmann (Ars Math. Contemp., 2021)

On the genera of polyhedral embeddings of cubic graph. - Gunnar Brinkmann; Thomas W. Tucker; Nico Van Cleemput (Discret. Math. Theor. Comput. Sci., 2021)

4-connected polyhedra have at least a linear number of hamiltonian cycles. - Gunnar Brinkmann; Nico Van Cleemput (Eur. J. Comb., 2021)

A practical algorithm for the computation of the genus. - Gunnar Brinkmann (Ars Math. Contemp., 2022)

On 2-Factors Splitting an Embedded Graph into Two Plane Graphs. - Gunnar Brinkmann; Sara Chiers; Carol T. Zamfirescu (Graphs Comb., 2022)

The connectivity of the dual. - Drago Bokal; Gunnar Brinkmann; Carol T. Zamfirescu (J. Graph Theory, 2022)

The minimality of the Georges-Kelmans graph. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (Math. Comput., 2022)

On local operations that preserve symmetries and on preserving polyhedrality of maps. - Gunnar Brinkmann; Heidi Van den Camp (Ars Math. Contemp., 2023)

Uniquely hamiltonian graphs for many sets of degrees. - Gunnar Brinkmann; Matthias De Pauw (Discret. Math. Theor. Comput. Sci., 2024)

Drawing maps on oriented surfaces. - Gunnar Brinkmann (CoRR, 2025)