Martin Skoviera

103 papers A 1C 3Journal 96Unranked 3

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