List of publications

• F. Kardoš, E. Máčajová, J.P.Zerafa, Three-cuts are a charm: acyclicity in 3-connected cubic graphs, accepted to Combinatorica

• J. Karabáš, E. Máčajová, R. Nedela, M. Škoviera, Cubic graphs with colouring defect 3, Electron. J. Combin. 31(2) (2024), #P2.6.

• I. Allie, E. Máčajová, M. Škoviera, Flow resistance to resistance ratios in cubic graphs, Discrete Appl. Math. 342 (2024), 362-367.

• J. Goedgebeur, E. Máčajová, J. Renders, On the Frank Number and Nowhere-Zero Flows on Graphs. (2023) In: Paulusma, D., Ries, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2023. Lecture Notes in Computer Science, vol 14093. Springer, Cham.

• E. Máčajová, G. Mazzuoccolo, V. Mkrtchyan, J. P. Zerafa, Some snarks are worse than others, European J. Combin. 117 (2024), 103832.

• J. Karabáš, E. Máčajová, R. Nedela, M. Škoviera, Perfect-matching covers of cubic graphs with colouring defect 3 , in Proceedings of European 12th Conference on Combinatorics, Graph Theory and Applications (EuroComb'23)

• F. Kardoš, E. Máčajová, J.P.Zerafa, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching, J. Combin. Theory Ser. B 160 (2023), 1-14.

• J. Karabáš, E. Máčajová, R. Nedela, M. Škoviera, Girth, oddness, and colouring defect of snarks, Discrete Math. 345 (2022), 103040.

• A. Kompisová, E. Máčajová, Flow number and circular flow number of signed cubic graph, Discrete Math. 345 (2022), 112917.

• E. Máčajová, J. Rajník, Decomposition of cubic graphs with cyclic connectivity 5, Discrete Math. 345 (2022), 113036.

• B. Lužar, E. Máčajová, R. Soták, M. Škoviera, Strong edge colorings of graphs and the covers of Kneser graphs, Graph Theory 100 (2022), 686-697.

• I. Allie, E. Máčajová, M. Škoviera, Snarks with resistance n and flow resistance 2n, Electron. J. Combin. 29 (2022), P1.44.

• E. Máčajová, M. Škoviera, Cubic graphs with no short cycle covers, SIAM J. Discrete Math., 35(3) (2021), 2223–2233.

• E. Máčajová, J. Rajník, Decomposing cubic graphs with cyclic connectivity 5, accepted to European Conference on Combinatorics, Graph Theory and Applications (EuroComb'21)

• E. Máčajová, M. Škoviera, Long shortest cycle covers in cubic graphs , accepted to European Conference on Combinatorics, Graph Theory and Applications (EuroComb'21)

• E. Máčajová, M. Škoviera, Perfect matching index vs. circular flow number of a cubic graph, SIAM J. Disrete Math., 35(2) (2021), 1287–1297.

• E. Máčajová, M. Škoviera, Cubic graphs that cannot be covered with four perfect matchings, J. Combin. Theory Ser. B 150 (2021), 144-176.

• E. Máčajová, M. Škoviera, Superposition of snarks revisited, European J. Combin. 91 (2021), 103220 (21 pages).

• E. Máčajová, G. Mazzuoccolo, Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks, Proc. Amer. Math. Soc. 148 (2020), 4643-4652.

• A. Kompišová, E. Máčajová, Flow number and circular flow number of signed cubic graphs, Acta Math. Univ. Comenianae 88 (2019), 878-883.

• E. Máčajová, M. Škoviera, Permutation snarks of order 2 (mod 8), Acta Math. Univ. Comenianae 88 (2019), 929-934.

• J. Goedgebeur, E. Máčajová, M. Škoviera, The smallest nontrivial snarks of oddness 4, Discrete Appl. Math. 277 (2020), 139-162.

• E. Máčajová, M. Škoviera, Critical and flow-critical snarks coincide, Discuss. Math. Graph Theory 41 (2021), 503-515.

• E. Máčajová, E. Rollová, M. Škoviera, Circuit covers of signed Eulerian graphs, SIAM J. Disrete Math. 33 (2019), 933-957.

• J. Goedgebeur, E. Máčajová, M. Škoviera, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, Ars Math. Contemp. 16 (2019), 277-298.

• T. Kaiser, R. Lukot'ka, E. Máčajová, E. Rollová, Shorter signed circuit covers of graphs, J. Graph Theory 92 (2019), 39-56.

• E. Máčajová, M. Škoviera, Nowhere-zero flows on signed Eulerian graphs, SIAM J. Discrete Math 31 (2017), 1937-1952.

• E. Máčajová, M. Škoviera, Odd decomposition of Eulerian graphs, SIAM J. Discrete Math. 31 (2017), 1923-1936.

• E. Máčajová, M. Škoviera, Characteristic flows on signed graphs and short circuit covers, Electron. J. Combin. 23 (2016), P1.14.

• E. Máčajová, A. Raspaud, M. Škoviera, The chromatic number of a signed graph Electron. J. Combin. 23 (2016), P1.14.

• E. Máčajová, A. Raspaud, E. Rollová, M. Škoviera, Circuit covers of signed graphs, J. Graph Theory 81(2016), 120-133.

• R. Lukotka, E. Máčajová, J. Mazák, and M. Škoviera, Small snarks with large oddness, Electron. J. Combin. 22 (2015), #P1.51

• E. Máčajová, M. Škoviera, Remarks on nowhere-zero flows in signed cubic graphs, Discrete Math. 338 (2015), 809-815.

• E. Máčajová, J. Mazák, Cubic graphs with large circuference deficit, J. Graph Theory 82 (2016), 433-440.

• E. Máčajová, E. Steffen, The difference between the circular and the integer flow number of bidirected graphs, Discrete Math. 338 (2015), 866-867.

• B. Candráková, E. Máčajová, k-Regular graphs with the circular chromatic index close to k, Discrete Math. 322 (2014), 19-25.

• E. Máčajová, E. Rollová, Nowhere-zero flows on signed complete and complete bipartite graphs, J. Graph Theory 78 (2015), 108-130.

• E. Máčajová, J. Mazák, On even cycle decompositions of 4-regular line graphs, Discrete Math. 313 (2013), 1697-1699.

• E. Máčajová, Bridgeless cubic graphs are (7,2)-edge-choosable, SIAM J. Discrete Math. 27 (2013), 757-767.

• E. Máčajová, M. Škoviera, Sparsely intersecting perfect matchings in cubic graphs, Combinatorica 34 (2014), 61-94.

• J. Karabáš, E. Máčajová, R. Nedela, Six-decomposition of snarks, European J. Combin. 34 (2013), 111-122.

• M. J. Grannell, T. S. Griggs, E. Máčajová, and M. Škoviera, Colouring cubic graphs by point-intransitive Steiner triple systems, J. Graph Theory 74 (2013), 163-181.

• L. D. Andersen, E. Máčajová, J. Mazák, Optimal acyclic edge-colourings of cubic graphs, J. Graph Theory 71 (2012), 353-364.

• E. Máčajová, E. Rollová, On the flow numbers of signed complete and complete bipartite graphs, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), Electron. Notes Discrete Math. 38 (2011), 591-596.

• E. Máčajová, M. Škoviera, Determining the flow numbers of signed eulerian graphs, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), Electron. Notes Discrete Math. 38 (2011), 585-590.

• R. Lukotka, E. Máčajová, J. Mazák, and M. Škoviera, Circuits of length five in 2-factors of cubic graphs, Discrete Math. 312 (2012), 2131-2134.

• E. Máčajová, J. Mazák, An Algorithm for Optimal Acyclic Edge-colouring of Cubic Graphs, in Proceedings of FAW-AAIM'2011 Conference, Lecture Notes Comp. Sci. 6681 LNCS 136-146 (2011), Springer Verlag.

• E. Máčajová, A. Raspaud, M. Tarsi, X. Zhu, Short cycle covers of graphs and nowhere-zero flows J. Graph Theory 68 (2011), 340-348.

• E. Máčajová, M. Škoviera, Infinitely many hypohamiltonian cubic graphs of girth 7, Graphs Combin. 27 (2011), 231-241.

• D. Král', E. Máčajová, J. Mazák, J.-S. Sereni, Circular edge-colorings of cubic graphs with girth six J. Combin. Theory Ser. B 100 (2010), 351-358.

• D. Král', E. Máčajová, J. Mazák, and J.-S. Sereni Circular edge-colorings of cubic graphs with girth six, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), Electron. Notes Discrete Math. 34 (2009), 525-529.

• E. Máčajová and M. Škoviera, On a Conjecture of Fan and Raspaud, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), Electron. Notes Discrete Math. 34 (2009), 237-241.

• M. J. Grannell, T. S. Griggs, E. Máčajová, and M. Škoviera, Wilson-Schreiber Colourings of Cubic Graphs, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), Electron. Notes Discrete Math. 34 (2009), 225-229.

• D. Král', E. Máčajová, O. Pangrác, A. Raspaud, J.-S. Sereni, M. Škoviera, Projective, affine, and abelian colorings of cubic graphs, European J. Combin. 30 (2009), 53-69.

• D. Král', E. Máčajová, A. Pór and J.-S. Sereni Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs, Canad. J. Math. 62 (2010), 355-381.

• D. Král', E. Máčajová, A. Pór and J.-S. Sereni Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'07), Electron. Notes Discrete Math. 29 (2007), 23-27.

• D. Král', E. Máčajová, A. Pór and J.-S. Sereni Characterization of affine Steiner triple systems and Hall triple systems, in Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'07), Electron. Notes Discrete Math. 29 (2007), 17-21.

• E. Máčajová, M. Škoviera, Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6, Electron. J. Combin. 14 (2007), #R18

• E. Máčajová, M. Škoviera, Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6, Electron. Notes Discrete Math. 24 (2006), 125-132.

• E. Máčajová, M. Škoviera, Irreducible snarks of given order and cyclic connectivity, Discrete Math. 306 (2006), 779-791.

• E. Máčajová, A. Raspaud, On the Strong circular 5-flow conjecture, J. Graph Theory 52 (2006), 307-316.

• E. Máčajová, M. Škoviera, Fano colourings of cubic graphs and the Fulkerson conjecture, Theoret. Comput. Sci. 349 (2005), 112-120.

• E. Máčajová, A. Raspaud, M. Škoviera, Abelian Colourings of Cubic Graphs, Electron. Notes Discrete Math. 22 (2005), 333-339.

Submitted

• J. Karabáš, E. Máčajová, R. Nedela, M. Škoviera, Berge's conjecture for cubic graphs with small colouring defect

• J. Goedgebeur, E. Máčajová, J. Renders, Frank number and nowhere-zero flows on graphs

• J. Karabáš, E. Máčajová, R. Nedela, M. Škoviera, Colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson

• E. Máčajová, G. Mazzuoccolo, G. Tabarelli, Cycle Separating Cuts in possible counterexamples to the Cycle Double Cover and the Berge-Fulkerson Conjectures

• R. Luo, E. Máčajová, M. Škoviera, C.-Q. Zhang, An 8-flow theorem for signed graphs

• B. Lužar, E. Máčajová, R. Soták, D. Švecová, List strong and list normal edge-coloring of (sub)cubic graphs