1 citations · 1 across the 4 of their papers we have counts for
6 papers
Local Orientation-Preserving Symmetry Preserving Operations on Polyhedra
Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput
Unifying approaches by amongst others Archimedes, Kepler, Goldberg, Caspar and Klug, Coxeter, and Conway, and extending on a previous formalisation of the concept of local symmetry…
Generation of Delaney-Dress graphs
Nico Van Cleemput
We introduce an algorithm for the efficient generation of cubic pregraphs which have a 2-factor in which each component is a quotient of . This class of pregraphs is of partic…
Generation of Local Symmetry-Preserving Operations
Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput
We introduce a new practical and more general definition of local symmetry-preserving operations on polyhedra. These can be applied to arbitrary plane graphs and result in plane gr…
On the minimum leaf number of cubic graphs
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput +1
The \emph{minimum leaf number} of a connected graph is defined as the minimum number of leaves of the spanning trees of . We present new results concerning t…
Automated Conjecturing VII: The Graph Brain Project & Big Mathematics
N. Bushaw, C. E. Larson, N. Van Cleemput
The Graph Brain Project is an experiment in how the use of automated mathematical discovery software, databases, large collaboration, and systematic investigation provide a model f…
Hamiltonian-connectedness of triangulations with few separating triangles
Nico Van Cleemput
We prove that 3-connected triangulations with at most one separating triangle are hamiltonian-connected. In order to show bounds on the strongest form of this theorem, we proved th…