2 citations · 2 across the 2 of their papers we have counts for
6 papers
Cubic graphs that cannot be covered with four perfect matchings
Edita Máčajová, Martin Škoviera
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the…
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…
Complete regular dessins and skew-morphisms of cyclic groups
Yan-Quan Feng, Kan Hu, Roman Nedela +2
A dessin is a 2-cell embedding of a connected -coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving…
Critical and flow-critical snarks coincide
Edita Máčajová, Martin Škoviera
Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of sna…
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…
Chirality Groups of Maps and Hypermaps
Antonio Breda d'Azevedo, Gareth Jones, Roman Nedela +1
Although the phenomenon of chirality appears in many investigations of maps and hypermaps no detailed study of chirality seems to have been carried out. Chirality of maps and hyper…