Martin Skoviera

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 34

Top Topics

Biomarker Discovery

Graph Theoretic

Polynomially Solvable

Top Venues

Electron. J. Comb.

SIAM J. Discret. Math.

Publications

Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
Cubic Graphs with Colouring Defect 3. Electron. J. Comb. 31 (2) (2024)
Jaroslav Nesetril, Martin Skoviera
Preface. Eur. J. Comb. 117 (2024)
Martin Skoviera, Peter Varsa
Deciding whether four perfect matchings can cover the edges of a snark is NP-complete. Theor. Comput. Sci. 988 (2024)
Roman Nedela, Michaela Seifrtová, Martin Skoviera
Decycling cubic graphs. Discret. Math. 347 (9) (2024)
Imran Allie, Edita Mácajová, Martin Skoviera
Flow resistance to resistance ratios in cubic graphs. Discret. Appl. Math. 342 (2024)
Roman Nedela, Michaela Seifrtová, Martin Skoviera
Decycling cubic graphs. CoRR (2023)
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
Girth, oddness, and colouring defect of snarks. Discret. Math. 345 (11) (2022)
Ján Mazák, Jozef Rajník, Martin Skoviera
Structural Analysis of Cubic Graphs based on 5-cycle Clusters. ITAT (2022)
Martin Skoviera, Peter Varsa
NP-Completeness of Perfect Matching Index of Cubic Graphs. STACS (2022)
Roman Nedela, Martin Skoviera
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs. J. Comb. Theory, Ser. B 155 (2022)
Borut Luzar, Edita Mácajová, Martin Skoviera, Roman Soták
Strong edge colorings of graphs and the covers of Kneser graphs. J. Graph Theory 100 (4) (2022)
Imran Allie, Edita Mácajová, Martin Skoviera
Snarks with Resistance $n$ and Flow Resistance $2n$. Electron. J. Comb. 29 (1) (2022)
Ján Mazák, Jozef Rajník, Martin Skoviera
Morphology of Small Snarks. Electron. J. Comb. 29 (4) (2022)
Edita Mácajová, Martin Skoviera
Cubic graphs that cannot be covered with four perfect matchings. J. Comb. Theory, Ser. B 150 (2021)
Edita Mácajová, Martin Skoviera
Cubic Graphs with No Short Cycle Covers. SIAM J. Discret. Math. 35 (3) (2021)
Edita Mácajová, Martin Skoviera
Perfect Matching Index versus Circular Flow Number of a Cubic Graph. SIAM J. Discret. Math. 35 (2) (2021)
Edita Mácajová, Martin Skoviera
Superposition of snarks revisited. Eur. J. Comb. 91 (2021)
Edita Mácajová, Martin Skoviera
Critical and flow-critical snarks coincide. Discuss. Math. Graph Theory 41 (2) (2021)
Ján Mazák, Jozef Rajník, Martin Skoviera
Morphology of small snarks. CoRR (2021)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277 (2020)
Yan-Quan Feng, Kan Hu, Roman Nedela, Martin Skoviera, Na-Er Wang
Complete regular dessins and skew-morphisms of cyclic groups. Ars Math. Contemp. 18 (2) (2020)
Edita Mácajová, Edita Rollová, Martin Skoviera
Circuit Covers of Signed Eulerian Graphs. SIAM J. Discret. Math. 33 (2) (2019)
Michal Kotrbcík, Martin Skoviera
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. SOSA (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16 (2) (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. CoRR (2019)
Martin Skoviera, Piyush Harsh, Oleksii Serhiienko, Manuel Perez Belmonte, Thomas Michael Bohnert
Monetization of infrastructures and services. EuCNC (2017)
Edita Mácajová, Martin Skoviera
Odd Decompositions of Eulerian Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR (2017)
Edita Mácajová, Martin Skoviera
Nowhere-Zero Flows on Signed Eulerian Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Edita Mácajová, André Raspaud, Martin Skoviera
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23 (1) (2016)
Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera
Circuit Covers of Signed Graphs. J. Graph Theory 81 (2) (2016)
Edita Mácajová, Martin Skoviera
Characteristic Flows on Signed Graphs and Short Circuit Covers. Electron. J. Comb. 23 (3) (2016)
Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera
Decompositions of complete graphs into circulants. Discret. Math. 339 (10) (2016)
Jozef Sirán, Martin Skoviera
GEMS 2013. Ars Math. Contemp. 10 (2) (2016)
Kan Hu, Roman Nedela, Martin Skoviera, Naer Wang
Regular embeddings of cycles with multiple edges revisited. Ars Math. Contemp. 8 (1) (2015)
Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera
Small Snarks with Large Oddness. Electron. J. Comb. 22 (1) (2015)
Mirko Hornák, Zdenek Ryjácek, Martin Skoviera
Preface. Discret. Math. 338 (10) (2015)
Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9 (1) (2015)
Michal Kotrbcík, Martin Skoviera
Simple greedy 2-approximation algorithm for the maximum genus of a graph. CoRR (2015)
Edita Mácajová, Martin Skoviera
Remarks on nowhere-zero flows in signed cubic graphs. Discret. Math. 338 (5) (2015)
Edita Mácajová, Martin Skoviera
Sparsely intersecting perfect matchings in cubic graphs. Comb. 34 (1) (2014)
Shaofei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera
2-Groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs. Ars Math. Contemp. 6 (1) (2013)
Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera
Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems. J. Graph Theory 74 (2) (2013)
Aleksander Malnic, Roman Nedela, Martin Skoviera
Regular maps with nilpotent automorphism groups. Eur. J. Comb. 33 (8) (2012)
Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera
Circuits of length 5 in 2-factors of cubic graphs. Discret. Math. 312 (14) (2012)
Karina Chudá, Martin Skoviera
L(2, 1)-labelling of generalized prisms. Discret. Appl. Math. 160 (6) (2012)
Edita Rollová, Martin Skoviera
Nowhere-zero flows in Cartesian bundles of graphs. Eur. J. Comb. 33 (5) (2012)
Michal Kotrbcík, Martin Skoviera
Matchings, Cycle Bases, and the Maximum Genus of a Graph. Electron. J. Comb. 19 (3) (2012)
Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera
Small snarks with large oddness CoRR (2012)
Robert Lukot'ka, Martin Skoviera
Snarks with given real flow numbers. J. Graph Theory 68 (3) (2011)
Edita Mácajová, Martin Skoviera
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. Graphs Comb. 27 (2) (2011)
Roman Nedela, Martin Skoviera
GEMS 2009. Ars Math. Contemp. 4 (2) (2011)
Edita Mácajová, Martin Skoviera
Determining the flow numbers of signed eulerian graphs. Electron. Notes Discret. Math. 38 (2011)
Miroslav Chladný, Martin Skoviera
Factorisation of Snarks. Electron. J. Comb. 17 (1) (2010)
Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera
where n is a power of 2. II: The non-metacyclic case. Eur. J. Comb. 31 (7) (2010)
Edita Mácajová, Martin Skoviera
On a Conjecture of Fan and Raspaud. Electron. Notes Discret. Math. 34 (2009)
Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30 (1) (2009)
Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera
Wilson-Schreiber Colourings of Cubic Graphs. Electron. Notes Discret. Math. 34 (2009)
Gareth A. Jones, Roman Nedela, Martin Skoviera
Complete bipartite graphs with a unique regular embedding. J. Comb. Theory, Ser. B 98 (2) (2008)
Robert Lukot'ka, Martin Skoviera
Real flow number and the cycle rank of a graph. J. Graph Theory 59 (1) (2008)
Gareth A. Jones, Roman Nedela, Martin Skoviera
where n is an odd prime power. Eur. J. Comb. 28 (6) (2007)
Dávid Pál, Martin Skoviera
Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. Electron. Notes Discret. Math. 28 (2007)
Lubica Liskova, Martin Macaj, Martin Skoviera
Regular maps from Cayley graphs III: t-balanced Cayley maps. Discret. Math. 307 (3-5) (2007)
Dávid Pál, Martin Skoviera
Colouring Cubic Graphs by Small Steiner Triple Systems. Graphs Comb. 23 (2) (2007)
Edita Mácajová, Martin Skoviera
Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. J. Comb. 14 (1) (2007)
Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera
Preface. Electron. Notes Discret. Math. 28 (2007)
Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera
where n is a power of 2. I: Metacyclic case. Eur. J. Comb. 28 (6) (2007)
Miroslav Chladný, Martin Skoviera
Decompositions of Snarks into Repeated Dot-Products. Electron. Notes Discret. Math. 24 (2006)
Edita Mácajová, Martin Skoviera
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. Notes Discret. Math. 24 (2006)
Edita Mácajová, Martin Skoviera
Irreducible snarks of given order and cyclic connectivity. Discret. Math. 306 (8-9) (2006)
Edita Mácajová, Martin Skoviera
Fano colourings of cubic graphs and the Fulkerson Conjecture. Theor. Comput. Sci. 349 (1) (2005)
Primoz Potocnik, Martin Skoviera, Riste Skrekovski
Nowhere-zero 3-flows in abelian Cayley graphs. Discret. Math. 297 (1-3) (2005)
Edita Mácajová, André Raspaud, Martin Skoviera
Abelian Colourings of Cubic Graphs. Electron. Notes Discret. Math. 22 (2005)
Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera
A Steiner triple system which colors all cubic graphs. J. Graph Theory 46 (1) (2004)
Roman Nedela, Martin Skoviera, Andrej Zlatos
Regular embeddings of complete bipartite graphs. Discret. Math. 258 (1-3) (2002)
Aleksander Malnic, Roman Nedela, Martin Skoviera
Regular Homomorphisms and Regular Map. Eur. J. Comb. 23 (4) (2002)
Roman Nedela, Martin Skoviera
Cayley Snarks and Almost Simple Groups. Comb. 21 (4) (2001)
Roman Nedela, Martin Skoviera
Regular Maps on Surfaces with Large Planar Width. Eur. J. Comb. 22 (2) (2001)
Aleksander Malnic, Roman Nedela, Martin Skoviera
Lifting Graph Automorphisms by Voltage Assignments. Eur. J. Comb. 21 (7) (2000)
Roman Nedela, Martin Skoviera
Regular Maps from Voltage Assignments and Exponent Groups. Eur. J. Comb. 18 (7) (1997)
Roman Nedela, Martin Skoviera
Decompositions and reductions of snarks. J. Graph Theory 22 (3) (1996)
Roman Nedela, Martin Skoviera
Regular Embeddings of Canonical Double Coverings of Graphs. J. Comb. Theory, Ser. B 67 (2) (1996)
Roman Nedela, Martin Skoviera
Which generalized petersen graphs are cayley graphs? J. Graph Theory 19 (1) (1995)
Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera
Branched coverings of maps and lifts of map homomorphisms. Australas. J Comb. 9 (1994)
Jozef Sirán, Martin Skoviera, Heinz-Jürgen Voss
Sachs triangulations and regular maps. Discret. Math. 134 (1-3) (1994)
Jozef Sirán, Martin Skoviera
Regular maps from Cayley graphs II antibalanced Cayley maps. Discret. Math. 124 (1-3) (1994)
Jozef Sirán, Martin Skoviera
Orientable and non-orientable maps with given automorphism groups. Australas. J Comb. 7 (1993)
Martin Skoviera, Jozef Sirán
Regular maps from Cayley graphs, part 1: Balanced Cayley maps. Discret. Math. 109 (1-3) (1992)
Jozef Sirán, Martin Skoviera
Groups with sign structure and their antiautomorphisms. Discret. Math. 108 (1-3) (1992)
Jozef Sirán, Martin Skoviera
Characterization of the maximum genus of a signed graph. J. Comb. Theory, Ser. B 52 (1) (1991)
Martin Skoviera
The maximum genus of graphs of diameter two. Discret. Math. 87 (2) (1991)
Martin Skoviera, Roman Nedela
The maximum genus of vertex-transitive graphs. Discret. Math. 78 (1-2) (1989)
Bojan Mohar, Tomaz Pisanski, Martin Skoviera
The Maximum Genus of Graph Bundles. Eur. J. Comb. 9 (3) (1988)
Martin Skoviera
A contribution to the theory of voltage graphs. Discret. Math. 61 (2-3) (1986)
Jozef Sirán, Martin Skoviera
Quotients of connected regular graphs of even degree. J. Comb. Theory, Ser. B 38 (3) (1985)
Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur T. White
The cartesian product of three triangles can be embedded into a surface of genus 7. Discret. Math. 56 (1) (1985)