CaGe—a virtual environment for studying some special classes of plane graphs—an update G Brinkmann, OD Friedrichs, S Lisken, A Peeters, N Van Cleemput MATCH Commun. Math. Comput. Chem 63 (3), 533-552, 2010 | 127 | 2010 |
Directed networks as a novel way to describe and analyze cardiac excitation: directed graph mapping N Vandersickel, E Van Nieuwenhuyse, N Van Cleemput, J Goedgebeur, ... Frontiers in physiology 10, 1138, 2019 | 44 | 2019 |
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited CE Larson, N Van Cleemput Artificial Intelligence 231, 17-38, 2016 | 28 | 2016 |
Classification and generation of nanocones G Brinkmann, N Van Cleemput Discrete Applied Mathematics 159 (15), 1528-1539, 2011 | 28 | 2011 |
GrInvIn in a nutshell A Peeters, K Coolsaet, G Brinkmann, N Van Cleemput, V Fack Journal of mathematical chemistry 45, 471-477, 2009 | 25 | 2009 |
Evaluation of directed graph-mapping in complex atrial tachycardias E Van Nieuwenhuyse, T Strisciuglio, G Lorenzo, M El Haddad, ... Clinical Electrophysiology 7 (7), 936-949, 2021 | 16 | 2021 |
Generation of various classes of trivalent graphs G Brinkmann, N Van Cleemput, T Pisanski Theoretical Computer Science 502, 16-29, 2013 | 16 | 2013 |
Automated Conjecturing VI: Domination number of benzenoids L Hutchinson, V Kamat, CE Larson, S Mehta, D Muncy, N Van Cleemput MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 80 (3), 821-834, 2018 | 14 | 2018 |
Automated conjecturing III: Property-relations conjectures CE Larson, N Van Cleemput Annals of Mathematics and Artificial Intelligence 81, 315-327, 2017 | 11 | 2017 |
10-Gabriel graphs are Hamiltonian T Kaiser, M Saumell, N Van Cleemput Information Processing Letters 115 (11), 877-881, 2015 | 11 | 2015 |
Spherical tilings by congruent quadrangles: Forbidden cases and substructures Y Akama, N Van Cleemput Ars Mathematica Contemporanea 8 (2), 297-318, 2015 | 11 | 2015 |
The history of the generation of cubic graphs G Brinkmann, J Goedgebeur, N Van Cleemput International Journal of Chemical Modeling 5 (2-3), 203-225, 2013 | 11 | 2013 |
4-connected polyhedra have at least a linear number of hamiltonian cycles G Brinkmann, N Van Cleemput European Journal of Combinatorics 97, 103395, 2021 | 10 | 2021 |
On the number of hamiltonian cycles in triangulations with few separating triangles G Brinkmann, J Souffriau, N Van Cleemput Journal of Graph Theory 87 (2), 164-175, 2018 | 10 | 2018 |
Regular non-hamiltonian polyhedral graphs N Van Cleemput, CT Zamfirescu Applied Mathematics and Computation 338, 192-206, 2018 | 9 | 2018 |
Hamiltonian properties of polyhedra with few 3-cuts—a survey K Ozeki, N Van Cleemput, CT Zamfirescu Discrete Mathematics 341 (9), 2646-2660, 2018 | 9 | 2018 |
On the strongest form of a theorem of Whitney for hamiltonian cycles in plane triangulations G Brinkmann, J Souffriau, N Van Cleemput Journal of Graph Theory 83 (1), 78-91, 2016 | 7 | 2016 |
Sizes of pentagonal clusters in fullerenes N Bašić, G Brinkmann, PW Fowler, T Pisanski, N Van Cleemput Journal of Mathematical Chemistry 55, 1669-1682, 2017 | 6 | 2017 |
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian I Fabrici, T Madaras, M Timková, N Van Cleemput, CT Zamfirescu Applied Mathematics and Computation 392, 125714, 2021 | 5 | 2021 |
Local orientation-preserving symmetry preserving operations on polyhedra P Goetschalckx, K Coolsaet, N Van Cleemput Discrete Mathematics 344 (1), 112156, 2021 | 5 | 2021 |