12 citations · 26 across the 13 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Morphology of small snarks
Ján Mazák, Jozef Rajník, Martin Škoviera
The aim of this paper is to classify all snarks up to order and explain the reasons of their uncolourability. The crucial part of our approach is a computer-assisted structura…
cs.DM2012★ 2 cited
Small snarks with large oddness
Robert Lukotka, Edita Macajova, Jan Mazak +1
We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph with oddness other than th…