7 citations · 10 across the 6 of their papers we have counts for
6 papers
Top-down Automated Theorem Proving (Notes for Sir Timothy)
C. E. Larson, N. Van Cleemput
We describe a "top down" approach for automated theorem proving (ATP). Researchers might usefully investigate the forms of the theorems mathematicians use in practice, carefully ex…
Conjecturing-Based Discovery of Patterns in Data
J. P. Brooks, D. J. Edwards, C. E. Larson +1
We propose the use of a conjecturing machine that suggests feature relationships in the form of bounds involving nonlinear terms for numerical features and boolean expressions for…
On the genera of polyhedral embeddings of cubic graph
Gunnar Brinkmann, Thomas Tucker, Nico Van Cleemput
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient…
Hamiltonian cycles and 1-factors in 5-regular graphs
Nico Van Cleemput, Carol T. Zamfirescu
It is proven that for any integer and , there exist infinitely many 5-regular graphs of genus containing a 1-factorisation with exactly …
Sizes of Pentagonal Clusters in Fullerenes
Nino Bašić, Gunnar Brinkmann, Patrick W. Fowler +2
Stability and chemistry, both exohedral and endohedral, of fullerenes are critically dependent on the distribution of their obligatory 12 pentagonal faces. It is well known that th…
10-Gabriel graphs are Hamiltonian
Tomáš Kaiser, Maria Saumell, Nico Van Cleemput
Given a set of points in the plane, the -Gabriel graph of is the geometric graph with vertex set , where are connected by an edge if and only if the cl…