Edita Rollová

According to our database, Edita Rollová authored at least 15 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Perfect matchings in highly cyclically connected regular graphs.

Robert Lukotka, Edita Rollová

J. Graph Theory, 2022

2020

3-Flows with large support.

Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Sámal

J. Comb. Theory B, 2020

2019

Circuit Covers of Signed Eulerian Graphs.

Edita Mácajová, Edita Rollová, Martin Skoviera

SIAM J. Discret. Math., 2019

Shorter signed circuit covers of graphs.

Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová

J. Graph Theory, 2019

A Note on Counting Flows in Signed Graphs.

Matt DeVos, Edita Rollová, Robert Sámal

Electron. J. Comb., 2019

2018

Flows in Signed Graphs with Two Negative Edges.

Edita Rollová, Michael Schubert, Eckhard Steffen

Electron. J. Comb., 2018

2017

Perfect Matchings of Regular Bipartite Graphs.

Robert Lukot'ka, Edita Rollová

J. Graph Theory, 2017

A new proof of Seymour's 6-flow theorem.

Matt DeVos, Edita Rollová, Robert Sámal

J. Comb. Theory B, 2017

2016

Nowhere-Zero Flows in Signed Series-Parallel Graphs.

Tomás Kaiser, Edita Rollová

SIAM J. Discret. Math., 2016

Circuit Covers of Signed Graphs.

Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera

J. Graph Theory, 2016

2015

Homomorphisms of Signed Graphs.

Reza Naserasr, Edita Rollová, Éric Sopena

J. Graph Theory, 2015

Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs.

Edita Mácajová, Edita Rollová

J. Graph Theory, 2015

2013

Homomorphisms of planar signed graphs to signed projective cubes.

Reza Naserasr, Edita Rollová, Éric Sopena

Discret. Math. Theor. Comput. Sci., 2013

2012

Nowhere-zero flows in Cartesian bundles of graphs.

Edita Rollová, Martin Skoviera

Eur. J. Comb., 2012

2011

On the flow numbers of signed complete and complete bipartite graphs.

Edita Mácajová, Edita Rollová

Electron. Notes Discret. Math., 2011