< Back to previous page
Researcher
Gunnar Brinkmann
- Keywords:algorithms, graph theory
- Disciplines:General mathematics not elsewhere classified
Affiliations
- Department of Applied Mathematics, Computer Science and Statistics (Department)
Member
From1 Feb 2004 → Today
Projects
1 - 8 of 8
- The effect of local symmetry-preserving operations on graph invariantsFrom1 Nov 2020 → TodayFunding: BOF - doctoral mandates
- Longest Cycles and Spanning SubgraphsFrom1 Oct 2019 → 30 Sep 2022Funding: FWO senior postdoctoral fellowship
- Traceability and Hamiltonicity in Graphs with Connectivity RequirementsFrom1 Oct 2016 → 30 Sep 2019Funding: FWO fellowships
- Hypohamiltonian and Almost Hypohamiltonian GraphsFrom1 Sep 2015 → 31 Aug 2016Funding: BOF - Doctoral projects
- Solving mathematical and chemical problems by designing specialised generation algorithmsFrom1 Oct 2014 → 31 Dec 2020Funding: FWO fellowships, BOF - Other initiatives
- Structure generation with applications in chemistry, mathematics, and teachingFrom1 Dec 2010 → 31 Jul 2011Funding: BOF - Doctoral projects
- Francqui Intercommunautair grant Hadrien MélotFrom1 Jan 2010 → 30 Jun 2010Funding: Other federal public and semi-governmental institutions
- Structure generation with applications in chemistry, mathematics, and teachingFrom1 Oct 2009 → 30 Sep 2013Funding: FWO fellowships, BOF - Other initiatives
Publications
1 - 10 of 46
- On local operations that preserve symmetries and on preserving polyhedrality of maps(2023)
Authors: Gunnar Brinkmann, Heidi Van den Camp
- The connectivity of the dual(2022)
Authors: Drago Bokal, Gunnar Brinkmann, Carol Zamfirescu
Pages: 182 - 209 - On 2-factors splitting an embedded graph into two plane graphs(2022)
Authors: Gunnar Brinkmann, Sara Chiers, Carol Zamfirescu
- The minimality of the Georges-Kelmans graph(2022)
Authors: Gunnar Brinkmann, Jan Goedgebeur, Brendan D. Mckay
Pages: 1483 - 1500 - On the genera of polyhedral embeddings of cubic graphs(2021)
Authors: Gunnar Brinkmann, Thomas Tucker, Nicolas Van Cleemput
- Polyhedra with few 3-cuts are hamiltonian(2019)
Authors: Gunnar Brinkmann, Carol Zamfirescu
- GrinbergU+2019s criterion(2019)
Authors: Gunnar Brinkmann, Carol Zamfirescu
Pages: 32 - 42 - Patches with short boundaries(2019)
Authors: Gunnar Brinkmann, Simon Van den Eynde
Pages: 285 - 297 - Generation of cubic graphs and snarks with large girth(2017)
Authors: Gunnar Brinkmann, Jan Goedgebeur
Pages: 255 - 272 - A generation algorithm for nanojoins(2017)
Authors: Gunnar Brinkmann, Dieter Mourisse
Pages: 713 - 736