Gunnar Brinkmann

Publication Activity (10 Years)

Years Active: 1988-2023
Publications (10 Years): 18

Top Topics

Computationally Demanding

Graph Theoretic

Top Venues

Ars Math. Contemp.

J. Graph Theory

Publications

Gunnar Brinkmann, Heidi Van den Camp
On local operations that preserve symmetries and on preserving polyhedrality of maps. Ars Math. Contemp. 24 (2) (2023)
Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu
The connectivity of the dual. J. Graph Theory 101 (2) (2022)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The minimality of the Georges-Kelmans graph. Math. Comput. 91 (335) (2022)
Gunnar Brinkmann
A practical algorithm for the computation of the genus. Ars Math. Contemp. 22 (4) (2022)
Gunnar Brinkmann, Sara Chiers, Carol T. Zamfirescu
On 2-Factors Splitting an Embedded Graph into Two Plane Graphs. Graphs Comb. 38 (3) (2022)
Gunnar Brinkmann, Nico Van Cleemput
4-connected polyhedra have at least a linear number of hamiltonian cycles. Eur. J. Comb. 97 (2021)
Gunnar Brinkmann
A simple and elementary proof of Whitney's unique embedding theorem. Ars Math. Contemp. 20 (1) (2021)
Gunnar Brinkmann, Thomas W. Tucker, Nico Van Cleemput
On the genera of polyhedral embeddings of cubic graph. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Minimality of the Georges-Kelmans Graph. CoRR (2021)
Gunnar Brinkmann
A Practical Algorithm for the Computation of the Genus. CoRR (2020)
Gunnar Brinkmann, Kenta Ozeki, Nico Van Cleemput
-walks. Ars Math. Contemp. 17 (1) (2019)
Gunnar Brinkmann, Carol T. Zamfirescu
Grinberg's Criterion. Eur. J. Comb. 75 (2019)
Gunnar Brinkmann, Carol T. Zamfirescu
Polyhedra with Few 3-Cuts are Hamiltonian. Electron. J. Comb. 26 (1) (2019)
Gunnar Brinkmann, Simon Van den Eynde
Patches with short boundaries. Eur. J. Comb. 81 (2019)
Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput
On the number of hamiltonian cycles in triangulations with few separating triangles. J. Graph Theory 87 (2) (2018)
Gunnar Brinkmann, Robin Deklerck
Generation of Union-Closed Sets and Moore Families. J. Integer Seq. 21 (1) (2018)
Gunnar Brinkmann, Jan Goedgebeur
Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory 86 (2) (2017)
Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations. J. Graph Theory 83 (1) (2016)
Gunnar Brinkmann, Craig E. Larson, Jasper Souffriau, Nico Van Cleemput
Construction of planar 4-connected triangulations. Ars Math. Contemp. 9 (2) (2015)
Gunnar Brinkmann, Myriam Preissmann, Diana Sasaki
Snarks with total chromatic number 5. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Gunnar Brinkmann, Jan Goedgebeur
Generation of cubic graphs and snarks with large girth. CoRR (2015)
Gunnar Brinkmann, Nicolas Van Cleemput, Tomaz Pisanski
Generation of various classes of trivalent graphs. Theor. Comput. Sci. 502 (2013)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and properties of snarks. J. Comb. Theory, Ser. B 103 (4) (2013)
Gunnar Brinkmann
Generating regular directed graphs. Discret. Math. 313 (1) (2013)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161 (1-2) (2013)
Gunnar Brinkmann, Simon Crevals, John Frye
An independent set approach for the communication network of the GPS III system. Discret. Appl. Math. 161 (4-5) (2013)
Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
Ramsey numbers R(K3,G) for graphs of order 10 CoRR (2012)
Gunnar Brinkmann, Simon Crevals, Hadrien Mélot, Leanne Rylands, Eckhard Steffen
α-Labelings and the Structure of Trees with Nonzero α-Deficit. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes CoRR (2012)
Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
, G) for Graphs of Order 10. Electron. J. Comb. 19 (4) (2012)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and Properties of Snarks CoRR (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: a database of interesting graphs CoRR (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
A Database of Interesting Graphs: The House of Graphs. CTW (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes. J. Chem. Inf. Model. 52 (11) (2012)
Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
Snarks with Total Chromatic Number 5. CTW (2012)
Gunnar Brinkmann, Nicolas Van Cleemput
Classification and generation of nanocones. Discret. Appl. Math. 159 (15) (2011)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13 (2) (2011)
Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
Graph structural properties of non-Yutsis graphs allowing fast recognition. Discret. Appl. Math. 157 (2) (2009)
Gunnar Brinkmann, Jan Degraer, Karel De Loof
Rehabilitation of an unloved child: semi-splaying. Softw. Pract. Exp. 39 (1) (2009)
Gunnar Brinkmann, Nicolas Van Cleemput
NANOCONES - A Classification Result in Chemistry. CTW (2009)
Mustapha Aouchiche, Gunnar Brinkmann, Pierre Hansen
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. Discret. Appl. Math. 156 (13) (2008)
Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack
GrInvIn for graph theory teaching and research. CTW (2007)
Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
Generation of simple quadrangulations of the sphere. Discret. Math. 305 (1-3) (2005)
Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
To be or not to be Yutsis: Algorithms for the decision problem. Comput. Phys. Commun. 173 (1-2) (2005)
Gunnar Brinkmann, Brendan D. McKay
Construction of planar triangulations with minimum degree 5. Discret. Math. 301 (2-3) (2005)
Drago Bokal, Gunnar Brinkmann, Stefan Grünewald
Chromatic-index-critical graphs of orders 13 and 14. Discret. Math. 300 (1-3) (2005)
Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons. J. Chem. Inf. Comput. Sci. 43 (3) (2003)
Gunnar Brinkmann, Patrick W. Fowler
A Catalogue of Growth Transformations of Fullerene Polyhedra. J. Chem. Inf. Comput. Sci. 43 (6) (2003)
Jörn Bornhöft, Gunnar Brinkmann, Juliane Greinus
Pentagon-hexagon-patches with short boundaries. Eur. J. Comb. 24 (5) (2003)
Gunnar Brinkmann, Thomas Harmuth, Oliver Heidemeier
The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. Discret. Appl. Math. 128 (2-3) (2003)
Gunnar Brinkmann, Patrick W. Fowler, C. Justus
A Catalogue of Isomerization Transformations of Fullerene Polyhedra. J. Chem. Inf. Comput. Sci. 43 (3) (2003)
Gunnar Brinkmann, Brendan D. McKay
Posets on up to 16 Points. Order 19 (2) (2002)
Sandi Klavzar, Petra Zigert, Gunnar Brinkmann
Resonance graphs of catacondensed even ring systems are median. Discret. Math. 253 (1-3) (2002)
Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser
A constructive enumeration of nanotube cap. Discret. Appl. Math. 116 (1-2) (2002)
Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen
A constructive enumeration of fusenes and benzenoids. J. Algorithms 45 (2) (2002)
Gunnar Brinkmann, Olaf Delgado-Friedrichs, Ulrike von Nathusius
Numbers of Faces and Boundary Encodings of Patches. Graphs and Discovery (2001)
Anton Betten, Gunnar Brinkmann, Tomaz Pisanski
. Discret. Appl. Math. 99 (1-3) (2000)
Gunnar Brinkmann, Michel Deza
Lists of Face-Regular Polyhedra. J. Chem. Inf. Comput. Sci. 40 (3) (2000)
Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth
The Generation of Maximal Triangle-Free Graphs. Graphs Comb. 16 (2) (2000)
Gunnar Brinkmann, Brendan D. McKay
Fast generation of some classes of planar graphs. Electron. Notes Discret. Math. 3 (1999)
Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser
Fast generation of nanotube caps. Electron. Notes Discret. Math. 3 (1999)
Juliane Greinus, Gunnar Brinkmann
Patches with minimal boundary length. Electron. Notes Discret. Math. 3 (1999)
Gunnar Brinkmann
Isomorphism rejection in structure generation programs. Discrete Mathematical Chemistry (1998)
Gunnar Brinkmann, Eckhard Steffen
Snarks and Reducibility. Ars Comb. 50 (1998)
Gunnar Brinkmann, Patrick W. Fowler
Spiral Coding of Leapfrog Polyhedra. J. Chem. Inf. Comput. Sci. 38 (3) (1998)
Gunnar Brinkmann
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. Comb. Probab. Comput. 7 (2) (1998)
Gunnar Brinkmann, Eckhard Steffen
Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. 19 (8) (1998)
Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth
All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. Electron. J. Comb. 5 (1998)
Gunnar Brinkmann, Andreas W. M. Dress
A Constructive Enumeration of Fullerenes. J. Algorithms 23 (2) (1997)
Gunnar Brinkmann, Andreas W. M. Dress, Sören Perrey, Jens Stoye
Two applications of the Divide&Conquer principle in the molecular sciences. Math. Program. 79 (1997)
Gunnar Brinkmann, Eckhard Steffen
3- and 4-critical graphs of small even order. Discret. Math. 169 (1-3) (1997)
Darko Babic, Gunnar Brinkmann, Andreas W. M. Dress
Topological Resonance Energy of Fullerenes. J. Chem. Inf. Comput. Sci. 37 (5) (1997)
Gunnar Brinkmann
Fast generation of cubic graphs. J. Graph Theory 23 (2) (1996)
Gunnar Brinkmann, Brendan D. McKay, Carsten Saager
The Smallest Cubic Graphs of Girth Nine. Comb. Probab. Comput. 4 (1995)
Martina Möller, Hans Georg Carstens, Gunnar Brinkmann
Nowhere-zero flows in low genus graphs. J. Graph Theory 12 (2) (1988)