Edita Mácajová

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 33

Top Topics

Mathematical Problem Solving

Maximum Cardinality

Top Venues

Electron. J. Comb.

SIAM J. Discret. Math.

J. Graph Theory

Publications

Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
Cubic Graphs with Colouring Defect 3. Electron. J. Comb. 31 (2) (2024)
Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa
Some snarks are worse than others. Eur. J. Comb. 117 (2024)
Imran Allie, Edita Mácajová, Martin Skoviera
Flow resistance to resistance ratios in cubic graphs. Discret. Appl. Math. 342 (2024)
Jan Goedgebeur, Edita Mácajová, Jarne Renders
Frank number and nowhere-zero flows on graphs. CoRR (2023)
Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching. J. Comb. Theory, Ser. B 160 (2023)
Jan Goedgebeur, Edita Mácajová, Jarne Renders
On the Frank Number and Nowhere-Zero Flows on Graphs. WG (2023)
Anna Kompisová, Edita Mácajová
Flow number and circular flow number of signed cubic graphs. Discret. Math. 345 (8) (2022)
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
Girth, oddness, and colouring defect of snarks. Discret. Math. 345 (11) (2022)
Edita Mácajová, Jozef Rajník
Decomposition of cubic graphs with cyclic connectivity 5. Discret. Math. 345 (11) (2022)
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) (2022)
Imran Allie, Edita Mácajová, Martin Skoviera
Snarks with Resistance $n$ and Flow Resistance $2n$. Electron. J. Comb. 29 (1) (2022)
Edita Mácajová, Martin Skoviera
Cubic graphs that cannot be covered with four perfect matchings. J. Comb. Theory, Ser. B 150 (2021)
Edita Mácajová, Martin Skoviera
Cubic Graphs with No Short Cycle Covers. SIAM J. Discret. Math. 35 (3) (2021)
Edita Mácajová, Ján Mazák
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699]. Discret. Math. 344 (2) (2021)
Edita Mácajová, Martin Skoviera
Perfect Matching Index versus Circular Flow Number of a Cubic Graph. SIAM J. Discret. Math. 35 (2) (2021)
Edita Mácajová, Martin Skoviera
Superposition of snarks revisited. Eur. J. Comb. 91 (2021)
Edita Mácajová, Martin Skoviera
Critical and flow-critical snarks coincide. Discuss. Math. Graph Theory 41 (2) (2021)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277 (2020)
Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová
Shorter signed circuit covers of graphs. J. Graph Theory 92 (1) (2019)
Edita Mácajová, Edita Rollová, Martin Skoviera
Circuit Covers of Signed Eulerian Graphs. SIAM J. Discret. Math. 33 (2) (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16 (2) (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. CoRR (2019)
Edita Mácajová, Martin Skoviera
Odd Decompositions of Eulerian Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR (2017)
Edita Mácajová, Martin Skoviera
Nowhere-Zero Flows on Signed Eulerian Graphs. SIAM J. Discret. Math. 31 (3) (2017)
Edita Mácajová, André Raspaud, Martin Skoviera
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23 (1) (2016)
Edita Mácajová, Ján Mazák
Cubic Graphs with Large Circumference Deficit. J. Graph Theory 82 (4) (2016)
Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera
Circuit Covers of Signed Graphs. J. Graph Theory 81 (2) (2016)
Edita Mácajová, Martin Skoviera
Characteristic Flows on Signed Graphs and Short Circuit Covers. Electron. J. Comb. 23 (3) (2016)
Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera
Small Snarks with Large Oddness. Electron. J. Comb. 22 (1) (2015)
Edita Mácajová, Eckhard Steffen
The difference between the circular and the integer flow number of bidirected graphs. Discret. Math. 338 (6) (2015)
Edita Mácajová, Edita Rollová
Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs. J. Graph Theory 78 (2) (2015)
Edita Mácajová, Martin Skoviera
Remarks on nowhere-zero flows in signed cubic graphs. Discret. Math. 338 (5) (2015)
Barbora Candráková, Edita Mácajová
k-Regular graphs with the circular chromatic index close to k. Discret. Math. 322 (2014)
Edita Mácajová, Martin Skoviera
Sparsely intersecting perfect matchings in cubic graphs. Comb. 34 (1) (2014)
Edita Mácajová, Ján Mazák
Cubic graphs with large circumference deficit. CoRR (2013)
Edita Mácajová, Ján Mazák
On even cycle decompositions of 4-regular line graphs. Discret. Math. 313 (17) (2013)
Edita Mácajová
Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable. SIAM J. Discret. Math. 27 (2) (2013)
Ján Karabás, Edita Mácajová, Roman Nedela
6-decomposition of snarks. Eur. J. Comb. 34 (1) (2013)
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) (2013)
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) (2012)
Lars Døvling Andersen, Edita Mácajová, Ján Mazák
Optimal acyclic edge-coloring of cubic graphs. J. Graph Theory 71 (4) (2012)
Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera
Small snarks with large oddness CoRR (2012)
Edita Mácajová, Edita Rollová
On the flow numbers of signed complete and complete bipartite graphs. Electron. Notes Discret. Math. 38 (2011)
Edita Mácajová, Ján Mazák
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. FAW-AAIM (2011)
Edita Mácajová, Martin Skoviera
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. Graphs Comb. 27 (2) (2011)
Edita Mácajová, Martin Skoviera
Determining the flow numbers of signed eulerian graphs. Electron. Notes Discret. Math. 38 (2011)
Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68 (4) (2011)
Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory, Ser. B 100 (4) (2010)
Edita Mácajová, Martin Skoviera
On a Conjecture of Fan and Raspaud. Electron. Notes Discret. Math. 34 (2009)
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) (2009)
Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera
Wilson-Schreiber Colourings of Cubic Graphs. Electron. Notes Discret. Math. 34 (2009)
Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
Circular edge-colorings of cubic graphs with girth six. Electron. Notes Discret. Math. 34 (2009)
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
Characterization of affine Steiner triple systems and Hall triple systems. Electron. Notes Discret. Math. 29 (2007)
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electron. Notes Discret. Math. 29 (2007)
Edita Mácajová, Martin Skoviera
Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. J. Comb. 14 (1) (2007)
Edita Mácajová, Martin Skoviera
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. Notes Discret. Math. 24 (2006)
Edita Mácajová, Martin Skoviera
Irreducible snarks of given order and cyclic connectivity. Discret. Math. 306 (8-9) (2006)
Edita Mácajová, André Raspaud
On the strong circular 5-flow conjecture. J. Graph Theory 52 (4) (2006)
Edita Mácajová, Martin Skoviera
Fano colourings of cubic graphs and the Fulkerson Conjecture. Theor. Comput. Sci. 349 (1) (2005)
Edita Mácajová, André Raspaud, Martin Skoviera
Abelian Colourings of Cubic Graphs. Electron. Notes Discret. Math. 22 (2005)