The cartesian product of three triangles can be embedded into a surface of genus 7. - Bojan Mohar; Tomaz Pisanski; Martin Skoviera; Arthur T. White (Discret. Math., 1985)

Quotients of connected regular graphs of even degree. - Jozef Sirán; Martin Skoviera (J. Comb. Theory B, 1985)

A contribution to the theory of voltage graphs. - Martin Skoviera (Discret. Math., 1986)

The Maximum Genus of Graph Bundles. - Bojan Mohar; Tomaz Pisanski; Martin Skoviera (Eur. J. Comb., 1988)

The maximum genus of vertex-transitive graphs. - Martin Skoviera; Roman Nedela (Discret. Math., 1989)

The maximum genus of graphs of diameter two. - Martin Skoviera (Discret. Math., 1991)

Characterization of the maximum genus of a signed graph. - Jozef Sirán; Martin Skoviera (J. Comb. Theory B, 1991)

Groups with sign structure and their antiautomorphisms. - Jozef Sirán; Martin Skoviera (Discret. Math., 1992)

Regular maps from Cayley graphs, part 1: Balanced Cayley maps. - Martin Skoviera; Jozef Sirán (Discret. Math., 1992)

Orientable and non-orientable maps with given automorphism groups. - Jozef Sirán; Martin Skoviera (Australas. J Comb., 1993)

Branched coverings of maps and lifts of map homomorphisms. - Dan Archdeacon; R. Bruce Richter; Jozef Sirán; Martin Skoviera (Australas. J Comb., 1994)

Regular maps from Cayley graphs II antibalanced Cayley maps. - Jozef Sirán; Martin Skoviera (Discret. Math., 1994)

Sachs triangulations and regular maps. - Jozef Sirán; Martin Skoviera; Heinz-Jürgen Voss (Discret. Math., 1994)

Which generalized petersen graphs are cayley graphs? - Roman Nedela; Martin Skoviera (J. Graph Theory, 1995)

Regular Embeddings of Canonical Double Coverings of Graphs. - Roman Nedela; Martin Skoviera (J. Comb. Theory B, 1996)

Decompositions and reductions of snarks. - Roman Nedela; Martin Skoviera (J. Graph Theory, 1996)

Regular Maps from Voltage Assignments and Exponent Groups. - Roman Nedela; Martin Skoviera (Eur. J. Comb., 1997)

Lifting Graph Automorphisms by Voltage Assignments. - Aleksander Malnic; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2000)

Cayley Snarks and Almost Simple Groups. - Roman Nedela; Martin Skoviera (Comb., 2001)

Regular Maps on Surfaces with Large Planar Width. - Roman Nedela; Martin Skoviera (Eur. J. Comb., 2001)

Regular embeddings of complete bipartite graphs. - Roman Nedela; Martin Skoviera; Andrej Zlatos (Discret. Math., 2002)

Regular Homomorphisms and Regular Map. - Aleksander Malnic; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2002)

A Steiner triple system which colors all cubic graphs. - Mike J. Grannell; Terry S. Griggs; Martin Knor; Martin Skoviera (J. Graph Theory, 2004)

Nowhere-zero 3-flows in abelian Cayley graphs. - Primoz Potocnik; Martin Skoviera; Riste Skrekovski (Discret. Math., 2005)

Abelian Colourings of Cubic Graphs. - Edita Mácajová; André Raspaud; Martin Skoviera (Electron. Notes Discret. Math., 2005)

Fano colourings of cubic graphs and the Fulkerson Conjecture. - Edita Mácajová; Martin Skoviera (Theor. Comput. Sci., 2005)

Irreducible snarks of given order and cyclic connectivity. - Edita Mácajová; Martin Skoviera (Discret. Math., 2006)

Decompositions of Snarks into Repeated Dot-Products. - Miroslav Chladný; Martin Skoviera (Electron. Notes Discret. Math., 2006)

Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2006)

Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. - Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2007)

Regular maps from Cayley graphs III: t-balanced Cayley maps. - Lubica Liskova; Martin Macaj; Martin Skoviera (Discret. Math., 2007)

Regular embeddings of Kn, n where n is a power of 2. I: Metacyclic case. - Shao-Fei Du; Gareth A. Jones; Jin Ho Kwak; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2007)

Regular embeddings of Kn, n where n is an odd prime power. - Gareth A. Jones; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2007)

Preface. - Petr Hlinený; Jan Kratochvíl; Roman Nedela; Martin Skoviera (Electron. Notes Discret. Math., 2007)

Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. - Dávid Pál; Martin Skoviera (Electron. Notes Discret. Math., 2007)

Colouring Cubic Graphs by Small Steiner Triple Systems. - Dávid Pál; Martin Skoviera (Graphs Comb., 2007)

Complete bipartite graphs with a unique regular embedding. - Gareth A. Jones; Roman Nedela; Martin Skoviera (J. Comb. Theory B, 2008)

Real flow number and the cycle rank of a graph. - Robert Lukot'ka; Martin Skoviera (J. Graph Theory, 2008)

Projective, affine, and abelian colorings of cubic graphs. - Daniel Král; Edita Mácajová; Ondrej Pangrác; André Raspaud; Jean-Sébastien Sereni; Martin Skoviera (Eur. J. Comb., 2009)

Wilson-Schreiber Colourings of Cubic Graphs. - Mike J. Grannell; Terry S. Griggs; Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2009)

On a Conjecture of Fan and Raspaud. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2009)

Factorisation of Snarks. - Miroslav Chladný; Martin Skoviera (Electron. J. Comb., 2010)

Regular embeddings of Kn, n where n is a power of 2. II: The non-metacyclic case. - Shao-Fei Du; Gareth A. Jones; Jin Ho Kwak; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2010)

GEMS 2009. - Roman Nedela; Martin Skoviera (Ars Math. Contemp., 2011)

Determining the flow numbers of signed eulerian graphs. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2011)

Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. - Edita Mácajová; Martin Skoviera (Graphs Comb., 2011)

Snarks with given real flow numbers. - Robert Lukot'ka; Martin Skoviera (J. Graph Theory, 2011)

Matchings, Cycle Bases, and the Maximum Genus of a Graph. - Michal Kotrbcík; Martin Skoviera (Electron. J. Comb., 2012)

L(2, 1)-labelling of generalized prisms. - Karina Chudá; Martin Skoviera (Discret. Appl. Math., 2012)

Circuits of length 5 in 2-factors of cubic graphs. - Robert Lukot'ka; Edita Mácajová; Ján Mazák; Martin Skoviera (Discret. Math., 2012)

Regular maps with nilpotent automorphism groups. - Aleksander Malnic; Roman Nedela; Martin Skoviera (Eur. J. Comb., 2012)

Nowhere-zero flows in Cartesian bundles of graphs. - Edita Rollová; Martin Skoviera (Eur. J. Comb., 2012)

2-Groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs. - Shaofei Du; Gareth A. Jones; Jin Ho Kwak; Roman Nedela; Martin Skoviera (Ars Math. Contemp., 2013)

Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems. - Mike J. Grannell; Terry S. Griggs; Edita Mácajová; Martin Skoviera (J. Graph Theory, 2013)

Sparsely intersecting perfect matchings in cubic graphs. - Edita Mácajová; Martin Skoviera (Comb., 2014)

Maximum genus, connectivity, and Nebeský's Theorem. - Dan Archdeacon; Michal Kotrbcík; Roman Nedela; Martin Skoviera (Ars Math. Contemp., 2015)

Regular embeddings of cycles with multiple edges revisited. - Kan Hu; Roman Nedela; Martin Skoviera; Naer Wang (Ars Math. Contemp., 2015)

Small Snarks with Large Oddness. - Robert Lukotka; Edita Mácajová; Ján Mazák; Martin Skoviera (Electron. J. Comb., 2015)

Preface. - Mirko Hornák; Zdenek Ryjácek; Martin Skoviera (Discret. Math., 2015)

Remarks on nowhere-zero flows in signed cubic graphs. - Edita Mácajová; Martin Skoviera (Discret. Math., 2015)

GEMS 2013. - Jozef Sirán; Martin Skoviera (Ars Math. Contemp., 2016)

The Chromatic Number of a Signed Graph. - Edita Mácajová; André Raspaud; Martin Skoviera (Electron. J. Comb., 2016)

Characteristic Flows on Signed Graphs and Short Circuit Covers. - Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2016)

Decompositions of complete graphs into circulants. - Mariusz Meszka; Roman Nedela; Alexander Rosa; Martin Skoviera (Discret. Math., 2016)

Circuit Covers of Signed Graphs. - Edita Mácajová; André Raspaud; Edita Rollová; Martin Skoviera (J. Graph Theory, 2016)

Monetization of infrastructures and services. - Martin Skoviera; Piyush Harsh; Oleksii Serhiienko; Manuel Perez Belmonte; Thomas Michael Bohnert (EuCNC, 2017)

Odd Decompositions of Eulerian Graphs. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2017)

Nowhere-Zero Flows on Signed Eulerian Graphs. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2017)

Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. - Michal Kotrbcík; Martin Skoviera (SOSA, 2019)

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Ars Math. Contemp., 2019)

Circuit Covers of Signed Eulerian Graphs. - Edita Mácajová; Edita Rollová; Martin Skoviera (SIAM J. Discret. Math., 2019)

Complete regular dessins and skew-morphisms of cyclic groups. - Yan-Quan Feng; Kan Hu; Roman Nedela; Martin Skoviera; Na-Er Wang (Ars Math. Contemp., 2020)

The smallest nontrivial snarks of oddness 4. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Discret. Appl. Math., 2020)

Critical and flow-critical snarks coincide. - Edita Mácajová; Martin Skoviera (Discuss. Math. Graph Theory, 2021)

Superposition of snarks revisited. - Edita Mácajová; Martin Skoviera (Eur. J. Comb., 2021)

Cubic graphs that cannot be covered with four perfect matchings. - Edita Mácajová; Martin Skoviera (J. Comb. Theory B, 2021)

Perfect Matching Index versus Circular Flow Number of a Cubic Graph. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2021)

Cubic Graphs with No Short Cycle Covers. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2021)

Structural Analysis of Cubic Graphs based on 5-cycle Clusters. - Ján Mazák; Jozef Rajník; Martin Skoviera (ITAT, 2022)

NP-Completeness of Perfect Matching Index of Cubic Graphs. - Martin Skoviera; Peter Varsa (STACS, 2022)

Snarks with Resistance $n$ and Flow Resistance $2n$. - Imran Allie; Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2022)

Morphology of Small Snarks. - Ján Mazák; Jozef Rajník; Martin Skoviera (Electron. J. Comb., 2022)

Girth, oddness, and colouring defect of snarks. - Ján Karabás; Edita Mácajová; Roman Nedela; Martin Skoviera (Discret. Math., 2022)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs. - Roman Nedela; Martin Skoviera (J. Comb. Theory B, 2022)

Strong edge colorings of graphs and the covers of Kneser graphs. - Borut Luzar; Edita Mácajová; Martin Skoviera; Roman Soták (J. Graph Theory, 2022)

Cubic Graphs with Colouring Defect 3. - Ján Karabás; Edita Mácajová; Roman Nedela; Martin Skoviera (Electron. J. Comb., 2024)

Decycling cubic graphs. - Roman Nedela; Michaela Seifrtová; Martin Skoviera (Discret. Math., 2024)

Deciding whether four perfect matchings can cover the edges of a snark is NP-complete. - Martin Skoviera; Peter Varsa (Theor. Comput. Sci., 2024)

Flow resistance to resistance ratios in cubic graphs. - Imran Allie; Edita Mácajová; Martin Skoviera (Discret. Appl. Math., 2024)

Preface. - Jaroslav Nesetril; Martin Skoviera (Eur. J. Comb., 2024)

An 8-Flow Theorem for Signed Graphs. - Rong Luo; Edita Mácajová; Martin Skoviera; Cun-Quan Zhang (SIAM J. Discret. Math., 2025)