Abelian Colourings of Cubic Graphs. - Edita Mácajová; André Raspaud; Martin Skoviera (Electron. Notes Discret. Math., 2005)

Fano colourings of cubic graphs and the Fulkerson Conjecture. - Edita Mácajová; Martin Skoviera (Theor. Comput. Sci., 2005)

Irreducible snarks of given order and cyclic connectivity. - Edita Mácajová; Martin Skoviera (Discret. Math., 2006)

Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2006)

On the strong circular 5-flow conjecture. - Edita Mácajová; André Raspaud (J. Graph Theory, 2006)

Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. - Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2007)

Characterization of affine Steiner triple systems and Hall triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. - Daniel Král; Edita Mácajová; Attila Pór; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2007)

Projective, affine, and abelian colorings of cubic graphs. - Daniel Král; Edita Mácajová; Ondrej Pangrác; André Raspaud; Jean-Sébastien Sereni; Martin Skoviera (Eur. J. Comb., 2009)

Wilson-Schreiber Colourings of Cubic Graphs. - Mike J. Grannell; Terry S. Griggs; Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2009)

On a Conjecture of Fan and Raspaud. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2009)

Circular edge-colorings of cubic graphs with girth six. - Daniel Král'; Edita Mácajová; Ján Mazák; Jean-Sébastien Sereni (J. Comb. Theory B, 2010)

An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. - Edita Mácajová; Ján Mazák (FAW-AAIM, 2011)

On the flow numbers of signed complete and complete bipartite graphs. - Edita Mácajová; Edita Rollová (Electron. Notes Discret. Math., 2011)

Determining the flow numbers of signed eulerian graphs. - Edita Mácajová; Martin Skoviera (Electron. Notes Discret. Math., 2011)

Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. - Edita Mácajová; Martin Skoviera (Graphs Comb., 2011)

Short cycle covers of graphs and nowhere-zero flows. - Edita Mácajová; André Raspaud; Michael Tarsi; Xuding Zhu (J. Graph Theory, 2011)

Circuits of length 5 in 2-factors of cubic graphs. - Robert Lukot'ka; Edita Mácajová; Ján Mazák; Martin Skoviera (Discret. Math., 2012)

Optimal acyclic edge-coloring of cubic graphs. - Lars Døvling Andersen; Edita Mácajová; Ján Mazák (J. Graph Theory, 2012)

On even cycle decompositions of 4-regular line graphs. - Edita Mácajová; Ján Mazák (Discret. Math., 2013)

6-decomposition of snarks. - Ján Karabás; Edita Mácajová; Roman Nedela (Eur. J. Comb., 2013)

Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems. - Mike J. Grannell; Terry S. Griggs; Edita Mácajová; Martin Skoviera (J. Graph Theory, 2013)

Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable. - Edita Mácajová (SIAM J. Discret. Math., 2013)

Sparsely intersecting perfect matchings in cubic graphs. - Edita Mácajová; Martin Skoviera (Comb., 2014)

k-Regular graphs with the circular chromatic index close to k. - Barbora Candráková; Edita Mácajová (Discret. Math., 2014)

Small Snarks with Large Oddness. - Robert Lukotka; Edita Mácajová; Ján Mazák; Martin Skoviera (Electron. J. Comb., 2015)

Remarks on nowhere-zero flows in signed cubic graphs. - Edita Mácajová; Martin Skoviera (Discret. Math., 2015)

The difference between the circular and the integer flow number of bidirected graphs. - Edita Mácajová; Eckhard Steffen (Discret. Math., 2015)

Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs. - Edita Mácajová; Edita Rollová (J. Graph Theory, 2015)

The Chromatic Number of a Signed Graph. - Edita Mácajová; André Raspaud; Martin Skoviera (Electron. J. Comb., 2016)

Characteristic Flows on Signed Graphs and Short Circuit Covers. - Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2016)

Cubic Graphs with Large Circumference Deficit. - Edita Mácajová; Ján Mazák (J. Graph Theory, 2016)

Circuit Covers of Signed Graphs. - Edita Mácajová; André Raspaud; Edita Rollová; Martin Skoviera (J. Graph Theory, 2016)

Odd Decompositions of Eulerian Graphs. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2017)

Nowhere-Zero Flows on Signed Eulerian Graphs. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2017)

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Ars Math. Contemp., 2019)

Shorter signed circuit covers of graphs. - Tomás Kaiser; Robert Lukot'ka; Edita Mácajová; Edita Rollová (J. Graph Theory, 2019)

Circuit Covers of Signed Eulerian Graphs. - Edita Mácajová; Edita Rollová; Martin Skoviera (SIAM J. Discret. Math., 2019)

The smallest nontrivial snarks of oddness 4. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Discret. Appl. Math., 2020)

Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699]. - Edita Mácajová; Ján Mazák (Discret. Math., 2021)

Critical and flow-critical snarks coincide. - Edita Mácajová; Martin Skoviera (Discuss. Math. Graph Theory, 2021)

Superposition of snarks revisited. - Edita Mácajová; Martin Skoviera (Eur. J. Comb., 2021)

Cubic graphs that cannot be covered with four perfect matchings. - Edita Mácajová; Martin Skoviera (J. Comb. Theory B, 2021)

Perfect Matching Index versus Circular Flow Number of a Cubic Graph. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2021)

Cubic Graphs with No Short Cycle Covers. - Edita Mácajová; Martin Skoviera (SIAM J. Discret. Math., 2021)

Snarks with Resistance $n$ and Flow Resistance $2n$. - Imran Allie; Edita Mácajová; Martin Skoviera (Electron. J. Comb., 2022)

Girth, oddness, and colouring defect of snarks. - Ján Karabás; Edita Mácajová; Roman Nedela; Martin Skoviera (Discret. Math., 2022)

Flow number and circular flow number of signed cubic graphs. - Anna Kompisová; Edita Mácajová (Discret. Math., 2022)

Decomposition of cubic graphs with cyclic connectivity 5. - Edita Mácajová; Jozef Rajník (Discret. Math., 2022)

Strong edge colorings of graphs and the covers of Kneser graphs. - Borut Luzar; Edita Mácajová; Martin Skoviera; Roman Soták (J. Graph Theory, 2022)

Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching. - Frantisek Kardos; Edita Mácajová; Jean Paul Zerafa (J. Comb. Theory B, 2023)

Cubic Graphs with Colouring Defect 3. - Ján Karabás; Edita Mácajová; Roman Nedela; Martin Skoviera (Electron. J. Comb., 2024)

List strong and list normal edge-coloring of (sub)cubic graphs. - Borut Luzar; Edita Mácajová; Roman Soták; Diana Svecová (CoRR, 2024)

Flow resistance to resistance ratios in cubic graphs. - Imran Allie; Edita Mácajová; Martin Skoviera (Discret. Appl. Math., 2024)

Some snarks are worse than others. - Edita Mácajová; Giuseppe Mazzuoccolo; Vahan Mkrtchyan; Jean Paul Zerafa (Eur. J. Comb., 2024)

The Frank number and nowhere-zero flows on graphs. - Jan Goedgebeur; Edita Mácajová; Jarne Renders (Eur. J. Comb., 2025)

An 8-Flow Theorem for Signed Graphs. - Rong Luo; Edita Mácajová; Martin Skoviera; Cun-Quan Zhang (SIAM J. Discret. Math., 2025)

Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs. - Frantisek Kardos; Edita Mácajová; Jean Paul Zerafa (Comb., 2025)