Edita Mácajová

73 papers B 1C 3Journal 68Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Cycle separating cuts in possible counterexamples to the cycle double cover and the Berge-Fulkerson conjectures.
Ars Math. Contemp.
Edita Mácajová, Giuseppe Mazzuoccolo, Gloria Tabarelli
2026 J jnl
List strong and list normal edge-coloring of (sub)cubic graphs.
Eur. J. Comb.
Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová
2026 J jnl
Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson.
Ars Math. Contemp.
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2025 J jnl
An 8-Flow Theorem for Signed Graphs.
SIAM J. Discret. Math.
Rong Luo, Edita Mácajová, Martin Skoviera, Cun-Quan Zhang
2025 C conf
Are there any permutation snarks on 6 (mod 8) vertices?
LAGOS
Edita Mácajová, Martin Skoviera
2025 J jnl
Berge's Conjecture for Cubic Graphs With Small Colouring Defect.
J. Graph Theory
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2025 C conf
Colouring defect of strong snarks.
LAGOS
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2025 J jnl
On covering cubic graphs with 3 perfect matchings.
CoRR
Edita Mácajová, Ján Mazák
2025 C conf
Short cycle covers and the colouring defect of a cubic graph.
LAGOS
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2025 J jnl
The Frank number and nowhere-zero flows on graphs.
Eur. J. Comb.
Jan Goedgebeur, Edita Mácajová, Jarne Renders
2025 J jnl
Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs.
Comb.
Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa
2024 J jnl
Cubic Graphs with Colouring Defect 3.
Electron. J. Comb.
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2024 J jnl
Flow resistance to resistance ratios in cubic graphs.
Discret. Appl. Math.
Imran Allie, Edita Mácajová, Martin Skoviera
2024 J jnl
List strong and list normal edge-coloring of (sub)cubic graphs.
CoRR
Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová
2024 J jnl
Some snarks are worse than others.
Eur. J. Comb.
Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa
2023 J jnl
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.
J. Comb. Theory B
Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa
2023 J jnl
Frank number and nowhere-zero flows on graphs.
CoRR
Jan Goedgebeur, Edita Mácajová, Jarne Renders
2023 B conf
On the Frank Number and Nowhere-Zero Flows on Graphs.
WG
Jan Goedgebeur, Edita Mácajová, Jarne Renders
2022 J jnl
Decomposition of cubic graphs with cyclic connectivity 5.
Discret. Math.
Edita Mácajová, Jozef Rajník
2022 J jnl
Flow number and circular flow number of signed cubic graphs.
Discret. Math.
Anna Kompisová, Edita Mácajová
2022 J jnl
Girth, oddness, and colouring defect of snarks.
Discret. Math.
Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera
2022 J jnl
Snarks with Resistance $n$ and Flow Resistance $2n$.
Electron. J. Comb.
Imran Allie, Edita Mácajová, Martin Skoviera
2022 J jnl
Strong edge colorings of graphs and the covers of Kneser graphs.
J. Graph Theory
Borut Luzar, Edita Mácajová, Martin Skoviera, Roman Soták
2021 J jnl
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699].
Discret. Math.
Edita Mácajová, Ján Mazák
2021 J jnl
Critical and flow-critical snarks coincide.
Discuss. Math. Graph Theory
Edita Mácajová, Martin Skoviera
2021 J jnl
Cubic Graphs with No Short Cycle Covers.
SIAM J. Discret. Math.
Edita Mácajová, Martin Skoviera
2021 J jnl
Cubic graphs that cannot be covered with four perfect matchings.
J. Comb. Theory B
Edita Mácajová, Martin Skoviera
2021 J jnl
Perfect Matching Index versus Circular Flow Number of a Cubic Graph.
SIAM J. Discret. Math.
Edita Mácajová, Martin Skoviera
2021 J jnl
Superposition of snarks revisited.
Eur. J. Comb.
Edita Mácajová, Martin Skoviera
2020 J jnl
The smallest nontrivial snarks of oddness 4.
Discret. Appl. Math.
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2019 J jnl
Circuit Covers of Signed Eulerian Graphs.
SIAM J. Discret. Math.
Edita Mácajová, Edita Rollová, Martin Skoviera
2019 J jnl
Shorter signed circuit covers of graphs.
J. Graph Theory
Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová
2019 J jnl
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44.
Ars Math. Contemp.
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2019 J jnl
The smallest nontrivial snarks of oddness 4.
CoRR
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2017 J jnl
Nowhere-Zero Flows on Signed Eulerian Graphs.
SIAM J. Discret. Math.
Edita Mácajová, Martin Skoviera
2017 J jnl
Odd Decompositions of Eulerian Graphs.
SIAM J. Discret. Math.
Edita Mácajová, Martin Skoviera
2017 J jnl
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44.
CoRR
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2016 J jnl
Characteristic Flows on Signed Graphs and Short Circuit Covers.
Electron. J. Comb.
Edita Mácajová, Martin Skoviera
2016 J jnl
Circuit Covers of Signed Graphs.
J. Graph Theory
Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera
2016 J jnl
Cubic Graphs with Large Circumference Deficit.
J. Graph Theory
Edita Mácajová, Ján Mazák
2016 J jnl
The Chromatic Number of a Signed Graph.
Electron. J. Comb.
Edita Mácajová, André Raspaud, Martin Skoviera
2015 J jnl
Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs.
J. Graph Theory
Edita Mácajová, Edita Rollová
2015 J jnl
Remarks on nowhere-zero flows in signed cubic graphs.
Discret. Math.
Edita Mácajová, Martin Skoviera
2015 J jnl
Small Snarks with Large Oddness.
Electron. J. Comb.
Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera
2015 J jnl
The difference between the circular and the integer flow number of bidirected graphs.
Discret. Math.
Edita Mácajová, Eckhard Steffen
2014 J jnl
Sparsely intersecting perfect matchings in cubic graphs.
Comb.
Edita Mácajová, Martin Skoviera
2014 J jnl
k-Regular graphs with the circular chromatic index close to k.
Discret. Math.
Barbora Candráková, Edita Mácajová
2013 J jnl
6-decomposition of snarks.
Eur. J. Comb.
Ján Karabás, Edita Mácajová, Roman Nedela
2013 J jnl
Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable.
SIAM J. Discret. Math.
Edita Mácajová
2013 J jnl
Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems.
J. Graph Theory
Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera
2013 J jnl
Cubic graphs with large circumference deficit.
CoRR
Edita Mácajová, Ján Mazák
2013 J jnl
On even cycle decompositions of 4-regular line graphs.
Discret. Math.
Edita Mácajová, Ján Mazák
2012 J jnl
Circuits of length 5 in 2-factors of cubic graphs.
Discret. Math.
Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera
2012 J jnl
Optimal acyclic edge-coloring of cubic graphs.
J. Graph Theory
Lars Døvling Andersen, Edita Mácajová, Ján Mazák
2012 J jnl
Small snarks with large oddness
CoRR
Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera
2011 — conf
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs.
FAW-AAIM
Edita Mácajová, Ján Mazák
2011 J jnl
Determining the flow numbers of signed eulerian graphs.
Electron. Notes Discret. Math.
Edita Mácajová, Martin Skoviera
2011 J jnl
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7.
Graphs Comb.
Edita Mácajová, Martin Skoviera
2011 J jnl
On the flow numbers of signed complete and complete bipartite graphs.
Electron. Notes Discret. Math.
Edita Mácajová, Edita Rollová
2011 J jnl
Short cycle covers of graphs and nowhere-zero flows.
J. Graph Theory
Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu
2010 J jnl
Circular edge-colorings of cubic graphs with girth six.
J. Comb. Theory B
Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
2009 J jnl
Circular edge-colorings of cubic graphs with girth six.
Electron. Notes Discret. Math.
Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni
2009 J jnl
On a Conjecture of Fan and Raspaud.
Electron. Notes Discret. Math.
Edita Mácajová, Martin Skoviera
2009 J jnl
Projective, affine, and abelian colorings of cubic graphs.
Eur. J. Comb.
Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera
2009 J jnl
Wilson-Schreiber Colourings of Cubic Graphs.
Electron. Notes Discret. Math.
Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera
2007 J jnl
Characterization of affine Steiner triple systems and Hall triple systems.
Electron. Notes Discret. Math.
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
2007 J jnl
Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.
Electron. J. Comb.
Edita Mácajová, Martin Skoviera
2007 J jnl
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electron. Notes Discret. Math.
Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni
2006 J jnl
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6.
Electron. Notes Discret. Math.
Edita Mácajová, Martin Skoviera
2006 J jnl
Irreducible snarks of given order and cyclic connectivity.
Discret. Math.
Edita Mácajová, Martin Skoviera
2006 J jnl
On the strong circular 5-flow conjecture.
J. Graph Theory
Edita Mácajová, André Raspaud
2005 J jnl
Abelian Colourings of Cubic Graphs.
Electron. Notes Discret. Math.
Edita Mácajová, André Raspaud, Martin Skoviera
2005 J jnl
Fano colourings of cubic graphs and the Fulkerson Conjecture.
Theor. Comput. Sci.
Edita Mácajová, Martin Skoviera