default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Skoviera
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j86]Ján Karabás
, Edita Mácajová, Roman Nedela, Martin Skoviera:
Cubic Graphs with Colouring Defect 3. Electron. J. Comb. 31(2) (2024)- [j85]Imran Allie, Edita Mácajová, Martin Skoviera:
Flow resistance to resistance ratios in cubic graphs. Discret. Appl. Math. 342: 362-367 (2024) - [j84]Roman Nedela, Michaela Seifrtová, Martin Skoviera:
Decycling cubic graphs. Discret. Math. 347(9): 114039 (2024) - [j83]Jaroslav Nesetril, Martin Skoviera:
Preface. Eur. J. Comb. 117: 103819 (2024) - [j82]Martin Skoviera, Peter Varsa:
Deciding whether four perfect matchings can cover the edges of a snark is NP-complete. Theor. Comput. Sci. 988: 114374 (2024) - 2023
- [i6]Roman Nedela, Michaela Seifrtová, Martin Skoviera:
Decycling cubic graphs. CoRR abs/2309.11606 (2023) - 2022
- [j81]Imran Allie, Edita Mácajová, Martin Skoviera:
Snarks with Resistance $n$ and Flow Resistance $2n$. Electron. J. Comb. 29(1) (2022) - [j80]Ján Mazák, Jozef Rajník, Martin Skoviera:
Morphology of Small Snarks. Electron. J. Comb. 29(4) (2022) - [j79]Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera:
Girth, oddness, and colouring defect of snarks. Discret. Math. 345(11): 113040 (2022) - [j78]Roman Nedela, Martin Skoviera:
Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs. J. Comb. Theory B 155: 17-44 (2022) - [j77]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): 686-697 (2022) - [c4]Ján Mazák, Jozef Rajník, Martin Skoviera:
Structural Analysis of Cubic Graphs based on 5-cycle Clusters. ITAT 2022: 214-222 - [c3]Martin Skoviera, Peter Varsa:
NP-Completeness of Perfect Matching Index of Cubic Graphs. STACS 2022: 56:1-56:12 - 2021
- [j76]Edita Mácajová, Martin Skoviera:
Critical and flow-critical snarks coincide. Discuss. Math. Graph Theory 41(2): 503-511 (2021) - [j75]Edita Mácajová, Martin Skoviera:
Superposition of snarks revisited. Eur. J. Comb. 91: 103220 (2021) - [j74]Edita Mácajová, Martin Skoviera:
Cubic graphs that cannot be covered with four perfect matchings. J. Comb. Theory B 150: 144-176 (2021) - [j73]Edita Mácajová, Martin Skoviera:
Perfect Matching Index versus Circular Flow Number of a Cubic Graph. SIAM J. Discret. Math. 35(2): 1287-1297 (2021) - [j72]Edita Mácajová, Martin Skoviera:
Cubic Graphs with No Short Cycle Covers. SIAM J. Discret. Math. 35(3): 2223-2233 (2021) - [i5]Ján Mazák, Jozef Rajník, Martin Skoviera:
Morphology of small snarks. CoRR abs/2112.04335 (2021) - 2020
- [j71]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): 289-307 (2020) - [j70]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277: 139-162 (2020)
2010 – 2019
- 2019
- [j69]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16(2): 277-298 (2019) - [j68]Edita Mácajová, Edita Rollová, Martin Skoviera:
Circuit Covers of Signed Eulerian Graphs. SIAM J. Discret. Math. 33(2): 933-957 (2019) - [c2]Michal Kotrbcík, Martin Skoviera:
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. SOSA 2019: 14:1-14:9 - [i4]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. CoRR abs/1901.10911 (2019) - 2017
- [j67]Edita Mácajová, Martin Skoviera:
Odd Decompositions of Eulerian Graphs. SIAM J. Discret. Math. 31(3): 1923-1936 (2017) - [j66]Edita Mácajová, Martin Skoviera:
Nowhere-Zero Flows on Signed Eulerian Graphs. SIAM J. Discret. Math. 31(3): 1937-1952 (2017) - [c1]Martin Skoviera, Piyush Harsh, Oleksii Serhiienko, Manuel Perez Belmonte, Thomas Michael Bohnert:
Monetization of infrastructures and services. EuCNC 2017: 1-5 - [i3]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR abs/1712.07867 (2017) - 2016
- [j65]Jozef Sirán, Martin Skoviera:
GEMS 2013. Ars Math. Contemp. 10(2) (2016) - [j64]Edita Mácajová, André Raspaud, Martin Skoviera:
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23(1): 1 (2016) - [j63]Edita Mácajová, Martin Skoviera:
Characteristic Flows on Signed Graphs and Short Circuit Covers. Electron. J. Comb. 23(3): 3 (2016) - [j62]Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera:
Decompositions of complete graphs into circulants. Discret. Math. 339(10): 2471-2480 (2016) - [j61]Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera:
Circuit Covers of Signed Graphs. J. Graph Theory 81(2): 120-133 (2016) - 2015
- [j60]Kan Hu, Roman Nedela, Martin Skoviera, Naer Wang:
Regular embeddings of cycles with multiple edges revisited. Ars Math. Contemp. 8(1): 177-194 (2015) - [j59]Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera:
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9(1): 51-61 (2015) - [j58]Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small Snarks with Large Oddness. Electron. J. Comb. 22(1): 1 (2015) - [j57]Edita Mácajová, Martin Skoviera:
Remarks on nowhere-zero flows in signed cubic graphs. Discret. Math. 338(5): 809-815 (2015) - [j56]Mirko Hornák, Zdenek Ryjácek, Martin Skoviera:
Preface. Discret. Math. 338(10): 1659 (2015) - [i2]Michal Kotrbcík, Martin Skoviera:
Simple greedy 2-approximation algorithm for the maximum genus of a graph. CoRR abs/1501.07460 (2015) - 2014
- [j55]Edita Mácajová, Martin Skoviera:
Sparsely intersecting perfect matchings in cubic graphs. Comb. 34(1): 61-94 (2014) - 2013
- [j54]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): 155-170 (2013) - [j53]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): 163-181 (2013) - 2012
- [j52]Michal Kotrbcík, Martin Skoviera:
Matchings, Cycle Bases, and the Maximum Genus of a Graph. Electron. J. Comb. 19(3): 3 (2012) - [j51]Karina Chudá, Martin Skoviera:
L(2, 1)-labelling of generalized prisms. Discret. Appl. Math. 160(6): 755-763 (2012) - [j50]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): 2131-2134 (2012) - [j49]Edita Rollová, Martin Skoviera:
Nowhere-zero flows in Cartesian bundles of graphs. Eur. J. Comb. 33(5): 867-871 (2012) - [j48]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular maps with nilpotent automorphism groups. Eur. J. Comb. 33(8): 1974-1986 (2012) - [i1]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small snarks with large oddness. CoRR abs/1212.3641 (2012) - 2011
- [j47]Roman Nedela, Martin Skoviera:
GEMS 2009. Ars Math. Contemp. 4(2) (2011) - [j46]Edita Mácajová, Martin Skoviera:
Determining the flow numbers of signed eulerian graphs. Electron. Notes Discret. Math. 38: 585-590 (2011) - [j45]Edita Mácajová, Martin Skoviera:
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. Graphs Comb. 27(2): 231-241 (2011) - [j44]Robert Lukot'ka, Martin Skoviera:
Snarks with given real flow numbers. J. Graph Theory 68(3): 189-201 (2011) - 2010
- [j43]Miroslav Chladný, Martin Skoviera:
Factorisation of Snarks. Electron. J. Comb. 17(1) (2010) - [j42]Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is a power of 2. II: The non-metacyclic case. Eur. J. Comb. 31(7): 1946-1956 (2010)
2000 – 2009
- 2009
- [j41]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): 53-69 (2009) - [j40]Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera:
Wilson-Schreiber Colourings of Cubic Graphs. Electron. Notes Discret. Math. 34: 225-229 (2009) - [j39]Edita Mácajová, Martin Skoviera:
On a Conjecture of Fan and Raspaud. Electron. Notes Discret. Math. 34: 237-241 (2009) - 2008
- [j38]Gareth A. Jones, Roman Nedela, Martin Skoviera:
Complete bipartite graphs with a unique regular embedding. J. Comb. Theory B 98(2): 241-248 (2008) - [j37]Robert Lukot'ka, Martin Skoviera:
Real flow number and the cycle rank of a graph. J. Graph Theory 59(1): 11-16 (2008) - 2007
- [j36]Edita Mácajová, Martin Skoviera:
Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. J. Comb. 14(1) (2007) - [j35]Lubica Liskova, Martin Macaj, Martin Skoviera:
Regular maps from Cayley graphs III: t-balanced Cayley maps. Discret. Math. 307(3-5): 517-533 (2007) - [j34]Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is a power of 2. I: Metacyclic case. Eur. J. Comb. 28(6): 1595-1609 (2007) - [j33]Gareth A. Jones, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is an odd prime power. Eur. J. Comb. 28(6): 1863-1875 (2007) - [j32]Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera:
Preface. Electron. Notes Discret. Math. 28: 1 (2007) - [j31]Dávid Pál, Martin Skoviera:
Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems. Electron. Notes Discret. Math. 28: 485-492 (2007) - [j30]Dávid Pál, Martin Skoviera:
Colouring Cubic Graphs by Small Steiner Triple Systems. Graphs Comb. 23(2): 217-228 (2007) - 2006
- [j29]Edita Mácajová, Martin Skoviera:
Irreducible snarks of given order and cyclic connectivity. Discret. Math. 306(8-9): 779-791 (2006) - [j28]Edita Mácajová, Martin Skoviera:
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. Notes Discret. Math. 24: 125-132 (2006) - [j27]Miroslav Chladný, Martin Skoviera:
Decompositions of Snarks into Repeated Dot-Products. Electron. Notes Discret. Math. 24: 215-222 (2006) - 2005
- [j26]Primoz Potocnik, Martin Skoviera, Riste Skrekovski:
Nowhere-zero 3-flows in abelian Cayley graphs. Discret. Math. 297(1-3): 119-127 (2005) - [j25]Edita Mácajová, André Raspaud, Martin Skoviera:
Abelian Colourings of Cubic Graphs. Electron. Notes Discret. Math. 22: 333-339 (2005) - [j24]Edita Mácajová, Martin Skoviera:
Fano colourings of cubic graphs and the Fulkerson Conjecture. Theor. Comput. Sci. 349(1): 112-120 (2005) - 2004
- [j23]Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera:
A Steiner triple system which colors all cubic graphs. J. Graph Theory 46(1): 15-24 (2004) - 2002
- [j22]Roman Nedela, Martin Skoviera, Andrej Zlatos:
Regular embeddings of complete bipartite graphs. Discret. Math. 258(1-3): 379-381 (2002) - [j21]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular Homomorphisms and Regular Map. Eur. J. Comb. 23(4): 449-461 (2002) - 2001
- [j20]Roman Nedela, Martin Skoviera:
Cayley Snarks and Almost Simple Groups. Comb. 21(4): 583-590 (2001) - [j19]Roman Nedela, Martin Skoviera:
Regular Maps on Surfaces with Large Planar Width. Eur. J. Comb. 22(2): 243-262 (2001) - 2000
- [j18]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Lifting Graph Automorphisms by Voltage Assignments. Eur. J. Comb. 21(7): 927-947 (2000)
1990 – 1999
- 1997
- [j17]Roman Nedela, Martin Skoviera:
Regular Maps from Voltage Assignments and Exponent Groups. Eur. J. Comb. 18(7): 807-823 (1997) - 1996
- [j16]Roman Nedela, Martin Skoviera:
Regular Embeddings of Canonical Double Coverings of Graphs. J. Comb. Theory B 67(2): 249-277 (1996) - [j15]Roman Nedela, Martin Skoviera:
Decompositions and reductions of snarks. J. Graph Theory 22(3): 253-279 (1996) - 1995
- [j14]Roman Nedela, Martin Skoviera:
Which generalized petersen graphs are cayley graphs? J. Graph Theory 19(1): 1-11 (1995) - 1994
- [j13]Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera:
Branched coverings of maps and lifts of map homomorphisms. Australas. J Comb. 9: 109-122 (1994) - [j12]Jozef Sirán, Martin Skoviera:
Regular maps from Cayley graphs II antibalanced Cayley maps. Discret. Math. 124(1-3): 179-191 (1994) - [j11]Jozef Sirán, Martin Skoviera, Heinz-Jürgen Voss:
Sachs triangulations and regular maps. Discret. Math. 134(1-3): 161-175 (1994) - 1993
- [j10]Jozef Sirán, Martin Skoviera:
Orientable and non-orientable maps with given automorphism groups. Australas. J Comb. 7: 47-54 (1993) - 1992
- [j9]Jozef Sirán, Martin Skoviera:
Groups with sign structure and their antiautomorphisms. Discret. Math. 108(1-3): 189-202 (1992) - [j8]Martin Skoviera, Jozef Sirán:
Regular maps from Cayley graphs, part 1: Balanced Cayley maps. Discret. Math. 109(1-3): 265-276 (1992) - 1991
- [j7]Martin Skoviera:
The maximum genus of graphs of diameter two. Discret. Math. 87(2): 175-180 (1991) - [j6]Jozef Sirán, Martin Skoviera:
Characterization of the maximum genus of a signed graph. J. Comb. Theory B 52(1): 124-146 (1991)
1980 – 1989
- 1989
- [j5]Martin Skoviera, Roman Nedela:
The maximum genus of vertex-transitive graphs. Discret. Math. 78(1-2): 179-186 (1989) - 1988
- [j4]Bojan Mohar, Tomaz Pisanski, Martin Skoviera:
The Maximum Genus of Graph Bundles. Eur. J. Comb. 9(3): 215-224 (1988) - 1986
- [j3]Martin Skoviera:
A contribution to the theory of voltage graphs. Discret. Math. 61(2-3): 281-292 (1986) - 1985
- [j2]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): 87-89 (1985) - [j1]Jozef Sirán, Martin Skoviera:
Quotients of connected regular graphs of even degree. J. Comb. Theory B 38(3): 214-225 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
