Nico Van Cleemput

Orcid: 0000-0001-9689-9302

Affiliations:
  • Ghent University, Department of Applied Mathematics, Computer Science and Statistics, Gent, Belgium


According to our database1, Nico Van Cleemput authored at least 30 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Top-down Automated Theorem Proving (Notes for Sir Timothy).
CoRR, 2023

2022
Planar hypohamiltonian oriented graphs.
J. Graph Theory, 2022

Hamiltonian cycles and 1-factors in 5-regular graphs.
J. Comb. Theory, Ser. B, 2022

2021
4-connected polyhedra have at least a linear number of hamiltonian cycles.
Eur. J. Comb., 2021

On the genera of polyhedral embeddings of cubic graph.
Discret. Math. Theor. Comput. Sci., 2021

Local orientation-preserving symmetry preserving operations on polyhedra.
Discret. Math., 2021

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian.
Appl. Math. Comput., 2021

2020
Automated Conjecturing II: Chomp and Reasoned Game Play.
J. Artif. Intell. Res., 2020

Conjecturing-Based Computational Discovery of Patterns in Data.
CoRR, 2020

Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs.
Electron. J. Comb., 2020

Generation of local symmetry-preserving operations on polyhedra.
Ars Math. Contemp., 2020

2019
On the minimum leaf number of cubic graphs.
Discret. Math., 2019

Hamiltonian-connectedness of triangulations with few separating triangles.
Contributions Discret. Math., 2019

Types of triangle in Hamiltonian triangulations and an application to domination and <i>k</i>-walks.
Ars Math. Contemp., 2019

2018
On the number of hamiltonian cycles in triangulations with few separating triangles.
J. Graph Theory, 2018

Hamiltonian properties of polyhedra with few 3-cuts - A survey.
Discret. Math., 2018

Automated Conjecturing VII: The Graph Brain Project & Big Mathematics.
CoRR, 2018

Regular non-hamiltonian polyhedral graphs.
Appl. Math. Comput., 2018

2017
Automated conjecturing III - Property-relations conjectures.
Ann. Math. Artif. Intell., 2017

Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations.
J. Graph Theory, 2016

Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited.
Artif. Intell., 2016

2015
10-Gabriel graphs are Hamiltonian.
Inf. Process. Lett., 2015

Construction of planar 4-connected triangulations.
Ars Math. Contemp., 2015

Alternating plane graphs.
Ars Math. Contemp., 2015

Spherical tilings by congruent quadrangles: Forbidden cases and substructures.
Ars Math. Contemp., 2015

2013
Generation of various classes of trivalent graphs.
Theor. Comput. Sci., 2013

2011
Classification and generation of nanocones.
Discret. Appl. Math., 2011

2009
NANOCONES - A Classification Result in Chemistry.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2007
GrInvIn for graph theory teaching and research.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007


  Loading...