12 citations · 41 across the 15 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013
Cubic graphs with large circumference deficit
Edita Máčajová, Ján Mazák
The circumference of a graph is the length of a longest cycle. By exploiting our recent results on resistance of snarks, we construct infinite classes of cyclically -…
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…