default search action
Gunnar Brinkmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j62]Gunnar Brinkmann, Heidi Van den Camp:
On local operations that preserve symmetries and on preserving polyhedrality of maps. Ars Math. Contemp. 24(2): 2 (2023) - 2022
- [j61]Gunnar Brinkmann:
A practical algorithm for the computation of the genus. Ars Math. Contemp. 22(4): 4 (2022) - [j60]Gunnar Brinkmann, Sara Chiers, Carol T. Zamfirescu
:
On 2-Factors Splitting an Embedded Graph into Two Plane Graphs. Graphs Comb. 38(3): 76 (2022) - [j59]Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu
The connectivity of the dual. J. Graph Theory 101(2): 182-209 (2022) - [j58]Gunnar Brinkmann, Jan Goedgebeur
The minimality of the Georges-Kelmans graph. Math. Comput. 91(335): 1483-1500 (2022) - 2021
- [j57]Gunnar Brinkmann:
A simple and elementary proof of Whitney's unique embedding theorem. Ars Math. Contemp. 20(1): 195-197 (2021) - [j56]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) - [j55]Gunnar Brinkmann, Nico Van Cleemput:
4-connected polyhedra have at least a linear number of hamiltonian cycles. Eur. J. Comb. 97: 103395 (2021) - [i7]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Minimality of the Georges-Kelmans Graph. CoRR abs/2101.00943 (2021) - 2020
- [i6]Gunnar Brinkmann:
A Practical Algorithm for the Computation of the Genus. CoRR abs/2005.08243 (2020)
2010 – 2019
- 2019
- [j54]Gunnar Brinkmann, Kenta Ozeki
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks. Ars Math. Contemp. 17(1): 51-66 (2019) - [j53]Gunnar Brinkmann, Carol T. Zamfirescu:
Polyhedra with Few 3-Cuts are Hamiltonian. Electron. J. Comb. 26(1): 1 (2019) - [j52]Gunnar Brinkmann, Carol T. Zamfirescu
Grinberg's Criterion. Eur. J. Comb. 75: 32-42 (2019) - [j51]Gunnar Brinkmann, Simon Van den Eynde
Patches with short boundaries. Eur. J. Comb. 81: 285-297 (2019) - 2018
- [j50]Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput
On the number of hamiltonian cycles in triangulations with few separating triangles. J. Graph Theory 87(2): 164-175 (2018) - [j49]Gunnar Brinkmann, Robin Deklerck:
Generation of Union-Closed Sets and Moore Families. J. Integer Seq. 21(1): 18.1.7 (2018) - 2017
- [j48]Gunnar Brinkmann, Jan Goedgebeur
Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory 86(2): 255-272 (2017) - 2016
- [j47]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): 78-91 (2016) - 2015
- [j46]Gunnar Brinkmann, Craig E. Larson, Jasper Souffriau, Nico Van Cleemput:
Construction of planar 4-connected triangulations. Ars Math. Contemp. 9(2): 145-149 (2015) - [j45]Gunnar Brinkmann, Myriam Preissmann
Snarks with total chromatic number 5. Discret. Math. Theor. Comput. Sci. 17(1): 369-382 (2015) - [i5]Gunnar Brinkmann, Jan Goedgebeur:
Generation of cubic graphs and snarks with large girth. CoRR abs/1512.05944 (2015) - 2013
- [j44]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161(1-2): 311-314 (2013) - [j43]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): 573-579 (2013) - [j42]Gunnar Brinkmann:
Generating regular directed graphs. Discret. Math. 313(1): 1-7 (2013) - [j41]Gunnar Brinkmann, Jan Goedgebeur
Generation and properties of snarks. J. Comb. Theory B 103(4): 468-488 (2013) - [j40]Gunnar Brinkmann, Nicolas Van Cleemput
Generation of various classes of trivalent graphs. Theor. Comput. Sci. 502: 16-29 (2013) - 2012
- [j39]Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta:
Ramsey Numbers R(K3, G) for Graphs of Order 10. Electron. J. Comb. 19(4): 36 (2012) - [j38]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): 159-174 (2012) - [j37]Gunnar Brinkmann, Jan Goedgebeur
The Generation of Fullerenes. J. Chem. Inf. Model. 52(11): 2910-2918 (2012) - [c6]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
A Database of Interesting Graphs: The House of Graphs. CTW 2012: 36-39 - [c5]Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki:
Snarks with Total Chromatic Number 5. CTW 2012: 40-43 - [i4]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: a database of interesting graphs. CoRR abs/1204.3549 (2012) - [i3]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and Properties of Snarks. CoRR abs/1206.6690 (2012) - [i2]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Generation of Fullerenes. CoRR abs/1207.7010 (2012) - [i1]Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta:
Ramsey numbers R(K3,G) for graphs of order 10. CoRR abs/1208.0501 (2012) - 2011
- [j36]Gunnar Brinkmann, Nicolas Van Cleemput
Classification and generation of nanocones. Discret. Appl. Math. 159(15): 1528-1539 (2011) - [j35]Gunnar Brinkmann, Jan Goedgebeur
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13(2): 69-80 (2011)
2000 – 2009
- 2009
- [j34]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): 377-386 (2009) - [j33]Gunnar Brinkmann, Jan Degraer, Karel De Loof:
Rehabilitation of an unloved child: semi-splaying. Softw. Pract. Exp. 39(1): 33-45 (2009) - [c4]Gunnar Brinkmann, Nicolas Van Cleemput:
NANOCONES - A Classification Result in Chemistry. CTW 2009: 333-336 - 2008
- [j32]Mustapha Aouchiche
Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number. Discret. Appl. Math. 156(13): 2530-2542 (2008) - 2007
- [c3]Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126 - 2005
- [j31]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): 61-70 (2005) - [j30]Drago Bokal, Gunnar Brinkmann, Stefan Grünewald:
Chromatic-index-critical graphs of orders 13 and 14. Discret. Math. 300(1-3): 16-29 (2005) - [j29]Gunnar Brinkmann, Brendan D. McKay
Construction of planar triangulations with minimum degree 5. Discret. Math. 301(2-3): 147-163 (2005) - [j28]Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay
Generation of simple quadrangulations of the sphere. Discret. Math. 305(1-3): 33-54 (2005) - 2003
- [j27]Gunnar Brinkmann, Thomas Harmuth, Oliver Heidemeier:
The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees. Discret. Appl. Math. 128(2-3): 541-554 (2003) - [j26]Jörn Bornhöft, Gunnar Brinkmann, Juliane Greinus:
Pentagon-hexagon-patches with short boundaries. Eur. J. Comb. 24(5): 517-529 (2003) - [j25]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): 842-851 (2003) - [j24]Gunnar Brinkmann, Patrick W. Fowler, C. Justus:
A Catalogue of Isomerization Transformations of Fullerene Polyhedra. J. Chem. Inf. Comput. Sci. 43(3): 917-927 (2003) - [j23]Gunnar Brinkmann, Patrick W. Fowler:
A Catalogue of Growth Transformations of Fullerene Polyhedra. J. Chem. Inf. Comput. Sci. 43(6): 1837-1843 (2003) - 2002
- [j22]Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser:
A constructive enumeration of nanotube cap. Discret. Appl. Math. 116(1-2): 55-71 (2002) - [j21]Sandi Klavzar
Resonance graphs of catacondensed even ring systems are median. Discret. Math. 253(1-3): 35-43 (2002) - [j20]Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen:
A constructive enumeration of fusenes and benzenoids. J. Algorithms 45(2): 155-166 (2002) - [j19]Gunnar Brinkmann, Brendan D. McKay:
Posets on up to 16 Points. Order 19(2): 147-179 (2002) - 2001
- [c2]Gunnar Brinkmann, Olaf Delgado-Friedrichs, Ulrike von Nathusius:
Numbers of Faces and Boundary Encodings of Patches. Graphs and Discovery 2001: 27-38 - 2000
- [j18]Anton Betten
Counting Symmetric Configurations v3. Discret. Appl. Math. 99(1-3): 331-338 (2000) - [j17]Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
The Generation of Maximal Triangle-Free Graphs. Graphs Comb. 16(2): 149-157 (2000) - [j16]Gunnar Brinkmann, Michel Deza:
Lists of Face-Regular Polyhedra. J. Chem. Inf. Comput. Sci. 40(3): 530-541 (2000)
1990 – 1999
- 1999
- [j15]Gunnar Brinkmann, Brendan D. McKay:
Fast generation of some classes of planar graphs. Electron. Notes Discret. Math. 3: 28-31 (1999) - [j14]Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser:
Fast generation of nanotube caps. Electron. Notes Discret. Math. 3: 32 (1999) - [j13]Juliane Greinus, Gunnar Brinkmann:
Patches with minimal boundary length. Electron. Notes Discret. Math. 3: 55-59 (1999) - 1998
- [j12]Gunnar Brinkmann, Eckhard Steffen:
Snarks and Reducibility. Ars Comb. 50 (1998) - [j11]Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. Electron. J. Comb. 5 (1998) - [j10]Gunnar Brinkmann:
All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. Comb. Probab. Comput. 7(2): 129-140 (1998) - [j9]Gunnar Brinkmann, Eckhard Steffen
Chromatic-Index-Critical Graphs of Orders 11 and 12. Eur. J. Comb. 19(8): 889-900 (1998) - [j8]Gunnar Brinkmann, Patrick W. Fowler:
Spiral Coding of Leapfrog Polyhedra. J. Chem. Inf. Comput. Sci. 38(3): 463-468 (1998) - [c1]Gunnar Brinkmann:
Isomorphism rejection in structure generation programs. Discrete Mathematical Chemistry 1998: 25-38 - 1997
- [j7]Gunnar Brinkmann, Eckhard Steffen
3- and 4-critical graphs of small even order. Discret. Math. 169(1-3): 193-197 (1997) - [j6]Gunnar Brinkmann, Andreas W. M. Dress:
A Constructive Enumeration of Fullerenes. J. Algorithms 23(2): 345-358 (1997) - [j5]Darko Babic, Gunnar Brinkmann, Andreas W. M. Dress:
Topological Resonance Energy of Fullerenes. J. Chem. Inf. Comput. Sci. 37(5): 920-923 (1997) - [j4]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: 71-97 (1997) - 1996
- [j3]Gunnar Brinkmann:
Fast generation of cubic graphs. J. Graph Theory 23(2): 139-149 (1996) - 1995
- [j2]Gunnar Brinkmann, Brendan D. McKay, Carsten Saager:
The Smallest Cubic Graphs of Girth Nine. Comb. Probab. Comput. 4: 317-329 (1995)
1980 – 1989
- 1988
- [j1]Martina Möller, Hans Georg Carstens, Gunnar Brinkmann:
Nowhere-zero flows in low genus graphs. J. Graph Theory 12(2): 183-190 (1988)
Coauthor Index
aka: Nicolas Van Cleemput
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: