59 citations · 241 across the 37 of their papers we have counts for
4 papers · 2 filters
On Ryser's Conjecture for Linear Intersecting Multipartite Hypergraphs
Nevena Francetić, Sarada Herke, Brendan D. McKay +1
Ryser conjectured that for -partite hypergraphs, where is the covering number and is the matching number. We prove this conjecture for in the specia…
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…
Hypohamiltonian planar cubic graphs with girth five
Brendan D. McKay
A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with…
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…