189 citations · 506 across the 54 of their papers we have counts for
5 papers · 1 filter
Generation of cubic graphs and snarks with large girth
Gunnar Brinkmann, Jan Goedgebeur
We describe two new algorithms for the generation of all non-isomorphic cubic graphs with girth at least which are very efficient for and show how these alg…
Fullerenes with distant pentagons
Jan Goedgebeur, Brendan D. McKay
For each , we find all the smallest fullerenes for which the least distance between two pentagons is . We also show that for each there is an such that fullerenes…
Exhaustive generation of -critical -free graphs
Jan Goedgebeur, Oliver Schaudt
We describe an algorithm for generating all -critical -free graphs, based on a method of Hoàng et al. Using this algorithm, we prove that there are only finitely man…
Obstructions for three-coloring graphs without induced paths on six vertices
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt +1
We prove that there are 24 4-critical -free graphs, and give the complete list. We remark that, if is connected and not a subgraph of , there are infinitely many 4-cr…
Recursive generation of IPR fullerenes
Jan Goedgebeur, Brendan D. McKay
We describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the…