189 citations · 506 across the 54 of their papers we have counts for
4 papers · 1 filter
Large independent sets in triangle-free cubic graphs: beyond planarity
Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret
Every -vertex planar triangle-free graph with maximum degree at most has an independent set of size at least . This was first conjectured by Albertson, Bollobá…
An algorithm and new bounds for the circular flow number of snarks
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
It is well-known that the circular flow number of a bridgeless cubic graph can be computed in terms of certain partitions of its vertex-set with prescribed properties. In the prese…
Existence of regular nut graphs for degree at most 11
Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur +2
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenverctor with no zero elements. The problem of determining the orders for which -regular nu…
The smallest nontrivial snarks of oddness 4
Jan Goedgebeur, Edita Máčajová, Martin Škoviera
The oddness of a cubic graph is the smallest number of odd circuits in a 2-factor of the graph. This invariant is widely considered to be one of the most important measures of unco…