189 citations · 506 across the 54 of their papers we have counts for
4 papers · 1 filter
Graphs with few Hamiltonian Cycles
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number of hamiltonian cycles, which is especially efficient for small . Ou…
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…
Bounds for the smallest -chromatic graphs of given girth
Geoffrey Exoo, Jan Goedgebeur
Let denote the smallest order of a -chromatic graph of girth at least . We consider the problem of determining for small values of and . After giving…
A unified approach to construct snarks with circular flow number 5
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
The well-known 5-flow Conjecture of Tutte, stated originally for integer flows, claims that every bridgeless graph has circular flow number at most 5. It is a classical result that…