Gunnar Brinkmann

79 papers C 4Journal 73Unranked 2

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