GrInvIn for graph theory teaching and research. - Adriaan Peeters; Kris Coolsaet; Gunnar Brinkmann; Nicolas Van Cleemput; Veerle Fack (CTW, 2007)

NANOCONES - A Classification Result in Chemistry. - Gunnar Brinkmann; Nicolas Van Cleemput (CTW, 2009)

Classification and generation of nanocones. - Gunnar Brinkmann; Nicolas Van Cleemput (Discret. Appl. Math., 2011)

Generation of various classes of trivalent graphs. - Gunnar Brinkmann; Nicolas Van Cleemput; Tomaz Pisanski (Theor. Comput. Sci., 2013)

Spherical tilings by congruent quadrangles: Forbidden cases and substructures. - Yohji Akama; Nico Van Cleemput (Ars Math. Contemp., 2015)

Alternating plane graphs. - Ingo Althöfer; Jan Kristian Haugland; Karl Scherer; Frank Schneider; Nico Van Cleemput (Ars Math. Contemp., 2015)

Construction of planar 4-connected triangulations. - Gunnar Brinkmann; Craig E. Larson; Jasper Souffriau; Nico Van Cleemput (Ars Math. Contemp., 2015)

10-Gabriel graphs are Hamiltonian. - Tomás Kaiser; Maria Saumell; Nico Van Cleemput (Inf. Process. Lett., 2015)

Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited. - Craig E. Larson; Nicolas Van Cleemput (Artif. Intell., 2016)

On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations. - Gunnar Brinkmann; Jasper Souffriau; Nico Van Cleemput (J. Graph Theory, 2016)

Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract). - Craig E. Larson; Nico Van Cleemput (IJCAI, 2017)

Automated conjecturing III - Property-relations conjectures. - Craig E. Larson; Nicolas Van Cleemput (Ann. Math. Artif. Intell., 2017)

Regular non-hamiltonian polyhedral graphs. - Nico Van Cleemput; Carol T. Zamfirescu (Appl. Math. Comput., 2018)

Automated Conjecturing VII: The Graph Brain Project & Big Mathematics. - Neal Bushaw; Craig E. Larson; Nicolas Van Cleemput (CoRR, 2018)

Hamiltonian properties of polyhedra with few 3-cuts - A survey. - Kenta Ozeki; Nico Van Cleemput; Carol T. Zamfirescu (Discret. Math., 2018)

On the number of hamiltonian cycles in triangulations with few separating triangles. - Gunnar Brinkmann; Jasper Souffriau; Nico Van Cleemput (J. Graph Theory, 2018)

Types of triangle in Hamiltonian triangulations and an application to domination and k-walks. - Gunnar Brinkmann; Kenta Ozeki; Nico Van Cleemput (Ars Math. Contemp., 2019)

Hamiltonian-connectedness of triangulations with few separating triangles. - Nico Van Cleemput (Contributions Discret. Math., 2019)

On the minimum leaf number of cubic graphs. - Jan Goedgebeur; Kenta Ozeki; Nico Van Cleemput; Gábor Wiener (Discret. Math., 2019)

Generation of local symmetry-preserving operations on polyhedra. - Pieter Goetschalckx; Kris Coolsaet; Nico Van Cleemput (Ars Math. Contemp., 2020)

Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. - On-Hei Solomon Lo; Jens M. Schmidt; Nico Van Cleemput; Carol T. Zamfirescu (Electron. J. Comb., 2020)

Conjecturing-Based Computational Discovery of Patterns in Data. - J. Paul Brooks; D. J. Edwards; Craig E. Larson; Nicolas Van Cleemput (CoRR, 2020)

Automated Conjecturing II: Chomp and Reasoned Game Play. - Alexander Bradford; J. Kain Day; Laura Hutchinson; Bryan Kaperick; Craig E. Larson; Matthew Mills; David Muncy; Nico Van Cleemput (J. Artif. Intell. Res., 2020)

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian. - Igor Fabrici; Tomás Madaras; Maria Timkova; Nico Van Cleemput; Carol T. Zamfirescu (Appl. Math. Comput., 2021)

Local orientation-preserving symmetry preserving operations on polyhedra. - Pieter Goetschalckx; Kris Coolsaet; Nico Van Cleemput (Discret. Math., 2021)

On the genera of polyhedral embeddings of cubic graph. - Gunnar Brinkmann; Thomas W. Tucker; Nico Van Cleemput (Discret. Math. Theor. Comput. Sci., 2021)

4-connected polyhedra have at least a linear number of hamiltonian cycles. - Gunnar Brinkmann; Nico Van Cleemput (Eur. J. Comb., 2021)

Hamiltonian cycles and 1-factors in 5-regular graphs. - Nico Van Cleemput; Carol T. Zamfirescu (J. Comb. Theory B, 2022)

Planar hypohamiltonian oriented graphs. - Alewyn P. Burger; Johan P. de Wet; Marietjie Frick; Nico Van Cleemput; Carol T. Zamfirescu (J. Graph Theory, 2022)

Top-down Automated Theorem Proving (Notes for Sir Timothy). - Craig E. Larson; Nicolas Van Cleemput (CoRR, 2023)

Shortness parameters of polyhedral graphs with few distinct vertex degrees. - On-Hei Solomon Lo; Jens M. Schmidt; Nico Van Cleemput; Carol T. Zamfirescu (Discret. Math., 2025)