Martin Skoviera

Orcid: 0000-0002-2108-7518

According to our database1, Martin Skoviera authored at least 90 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Preface.
Eur. J. Comb., March, 2024

Flow resistance to resistance ratios in cubic graphs.
Discret. Appl. Math., January, 2024

Deciding whether four perfect matchings can cover the edges of a snark is NP-complete.
Theor. Comput. Sci., 2024

Decycling cubic graphs.
Discret. Math., 2024

Cubic Graphs with Colouring Defect 3.
Electron. J. Comb., 2024

2022
Strong edge colorings of graphs and the covers of Kneser graphs.
J. Graph Theory, 2022

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs.
J. Comb. Theory B, 2022

Girth, oddness, and colouring defect of snarks.
Discret. Math., 2022

Morphology of Small Snarks.
Electron. J. Comb., 2022

Snarks with Resistance $n$ and Flow Resistance $2n$.
Electron. J. Comb., 2022

NP-Completeness of Perfect Matching Index of Cubic Graphs.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Structural Analysis of Cubic Graphs based on 5-cycle Clusters.
Proceedings of the 22nd Conference Information Technologies, 2022

2021
Cubic Graphs with No Short Cycle Covers.
SIAM J. Discret. Math., 2021

Perfect Matching Index versus Circular Flow Number of a Cubic Graph.
SIAM J. Discret. Math., 2021

Cubic graphs that cannot be covered with four perfect matchings.
J. Comb. Theory B, 2021

Superposition of snarks revisited.
Eur. J. Comb., 2021

Critical and flow-critical snarks coincide.
Discuss. Math. Graph Theory, 2021

2020
The smallest nontrivial snarks of oddness 4.
Discret. Appl. Math., 2020

Complete regular dessins and skew-morphisms of cyclic groups.
Ars Math. Contemp., 2020

2019
Circuit Covers of Signed Eulerian Graphs.
SIAM J. Discret. Math., 2019

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44.
Ars Math. Contemp., 2019

Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2017
Nowhere-Zero Flows on Signed Eulerian Graphs.
SIAM J. Discret. Math., 2017

Odd Decompositions of Eulerian Graphs.
SIAM J. Discret. Math., 2017

Monetization of infrastructures and services.
Proceedings of the 2017 European Conference on Networks and Communications, 2017

2016
Circuit Covers of Signed Graphs.
J. Graph Theory, 2016

Decompositions of complete graphs into circulants.
Discret. Math., 2016

Characteristic Flows on Signed Graphs and Short Circuit Covers.
Electron. J. Comb., 2016

The Chromatic Number of a Signed Graph.
Electron. J. Comb., 2016

GEMS 2013.
Ars Math. Contemp., 2016

2015
Remarks on nowhere-zero flows in signed cubic graphs.
Discret. Math., 2015

Preface.
Discret. Math., 2015

Small Snarks with Large Oddness.
Electron. J. Comb., 2015

Regular embeddings of cycles with multiple edges revisited.
Ars Math. Contemp., 2015

Maximum genus, connectivity, and Nebeský's Theorem.
Ars Math. Contemp., 2015

2014
Sparsely intersecting perfect matchings in cubic graphs.
Comb., 2014

2013
Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems.
J. Graph Theory, 2013

2-Groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs.
Ars Math. Contemp., 2013

2012
Nowhere-zero flows in Cartesian bundles of graphs.
Eur. J. Comb., 2012

Regular maps with nilpotent automorphism groups.
Eur. J. Comb., 2012

Circuits of length 5 in 2-factors of cubic graphs.
Discret. Math., 2012

L(2, 1)-labelling of generalized prisms.
Discret. Appl. Math., 2012

Matchings, Cycle Bases, and the Maximum Genus of a Graph.
Electron. J. Comb., 2012

2011
Snarks with given real flow numbers.
J. Graph Theory, 2011

Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7.
Graphs Comb., 2011

Determining the flow numbers of signed eulerian graphs.
Electron. Notes Discret. Math., 2011

GEMS 2009.
Ars Math. Contemp., 2011

2010
Regular embeddings of K<sub>n, n</sub> where n is a power of 2. II: The non-metacyclic case.
Eur. J. Comb., 2010

Factorisation of Snarks.
Electron. J. Comb., 2010

2009
On a Conjecture of Fan and Raspaud.
Electron. Notes Discret. Math., 2009

Wilson-Schreiber Colourings of Cubic Graphs.
Electron. Notes Discret. Math., 2009

Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb., 2009

2008
Real flow number and the cycle rank of a graph.
J. Graph Theory, 2008

Complete bipartite graphs with a unique regular embedding.
J. Comb. Theory B, 2008

2007
Colouring Cubic Graphs by Small Steiner Triple Systems.
Graphs Comb., 2007

Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems.
Electron. Notes Discret. Math., 2007

Preface.
Electron. Notes Discret. Math., 2007

Regular embeddings of K<sub>n, n</sub> where n is an odd prime power.
Eur. J. Comb., 2007

Regular embeddings of K<sub>n, n</sub> where n is a power of 2. I: Metacyclic case.
Eur. J. Comb., 2007

Regular maps from Cayley graphs III: t-balanced Cayley maps.
Discret. Math., 2007

Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.
Electron. J. Comb., 2007

2006
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.
Electron. Notes Discret. Math., 2006

Decompositions of Snarks into Repeated Dot-Products.
Electron. Notes Discret. Math., 2006

Irreducible snarks of given order and cyclic connectivity.
Discret. Math., 2006

2005
Fano colourings of cubic graphs and the Fulkerson Conjecture.
Theor. Comput. Sci., 2005

Abelian Colourings of Cubic Graphs.
Electron. Notes Discret. Math., 2005

Nowhere-zero 3-flows in abelian Cayley graphs.
Discret. Math., 2005

2004
A Steiner triple system which colors all cubic graphs.
J. Graph Theory, 2004

2002
Regular Homomorphisms and Regular Map.
Eur. J. Comb., 2002

Regular embeddings of complete bipartite graphs.
Discret. Math., 2002

2001
Regular Maps on Surfaces with Large Planar Width.
Eur. J. Comb., 2001

Cayley Snarks and Almost Simple Groups.
Comb., 2001

2000
Lifting Graph Automorphisms by Voltage Assignments.
Eur. J. Comb., 2000

1997
Regular Maps from Voltage Assignments and Exponent Groups.
Eur. J. Comb., 1997

1996
Decompositions and reductions of snarks.
J. Graph Theory, 1996

Regular Embeddings of Canonical Double Coverings of Graphs.
J. Comb. Theory B, 1996

1995
Which generalized petersen graphs are cayley graphs?
J. Graph Theory, 1995

1994
Sachs triangulations and regular maps.
Discret. Math., 1994

Regular maps from Cayley graphs II antibalanced Cayley maps.
Discret. Math., 1994

Branched coverings of maps and lifts of map homomorphisms.
Australas. J Comb., 1994

1993
Orientable and non-orientable maps with given automorphism groups.
Australas. J Comb., 1993

1992
Regular maps from Cayley graphs, part 1: Balanced Cayley maps.
Discret. Math., 1992

Groups with sign structure and their antiautomorphisms.
Discret. Math., 1992

1991
Characterization of the maximum genus of a signed graph.
J. Comb. Theory B, 1991

The maximum genus of graphs of diameter two.
Discret. Math., 1991

1989
The maximum genus of vertex-transitive graphs.
Discret. Math., 1989

1988
The Maximum Genus of Graph Bundles.
Eur. J. Comb., 1988

1986
A contribution to the theory of voltage graphs.
Discret. Math., 1986

1985
Quotients of connected regular graphs of even degree.
J. Comb. Theory B, 1985

The cartesian product of three triangles can be embedded into a surface of genus 7.
Discret. Math., 1985


  Loading...