default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdita Mácajová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j56]Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa:
Three-Cuts are a Charm: Acyclicity in 3-Connected Cubic Graphs. Comb. 45(1): 11 (2025)- [j55]Jan Goedgebeur, Edita Mácajová, Jarne Renders
:
The Frank number and nowhere-zero flows on graphs. Eur. J. Comb. 126: 104127 (2025) - 2024
- [j54]Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera:
Cubic Graphs with Colouring Defect 3. Electron. J. Comb. 31(2) (2024) - [j53]Imran Allie, Edita Mácajová, Martin Skoviera:
Flow resistance to resistance ratios in cubic graphs. Discret. Appl. Math. 342: 362-367 (2024) - [j52]Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa:
Some snarks are worse than others. Eur. J. Comb. 117: 103832 (2024) - [i6]Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová:
List strong and list normal edge-coloring of (sub)cubic graphs. CoRR abs/2410.01049 (2024) - 2023
- [j51]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 B 160: 1-14 (2023) - [c2]Jan Goedgebeur, Edita Mácajová, Jarne Renders:
On the Frank Number and Nowhere-Zero Flows on Graphs. WG 2023: 363-375 - [i5]Jan Goedgebeur, Edita Mácajová, Jarne Renders:
Frank number and nowhere-zero flows on graphs. CoRR abs/2305.02133 (2023) - 2022
- [j50]Imran Allie, Edita Mácajová, Martin Skoviera:
Snarks with Resistance $n$ and Flow Resistance $2n$. Electron. J. Comb. 29(1) (2022) - [j49]Anna Kompisová, Edita Mácajová:
Flow number and circular flow number of signed cubic graphs. Discret. Math. 345(8): 112917 (2022) - [j48]Edita Mácajová, Jozef Rajník:
Decomposition of cubic graphs with cyclic connectivity 5. Discret. Math. 345(11): 113036 (2022) - [j47]Ján Karabás, Edita Mácajová, Roman Nedela, Martin Skoviera:
Girth, oddness, and colouring defect of snarks. Discret. Math. 345(11): 113040 (2022) - [j46]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): 686-697 (2022) - 2021
- [j45]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): 112175 (2021) - [j44]Edita Mácajová, Martin Skoviera:
Critical and flow-critical snarks coincide. Discuss. Math. Graph Theory 41(2): 503-511 (2021) - [j43]Edita Mácajová, Martin Skoviera:
Superposition of snarks revisited. Eur. J. Comb. 91: 103220 (2021) - [j42]Edita Mácajová, Martin Skoviera:
Cubic graphs that cannot be covered with four perfect matchings. J. Comb. Theory B 150: 144-176 (2021) - [j41]Edita Mácajová, Martin Skoviera:
Perfect Matching Index versus Circular Flow Number of a Cubic Graph. SIAM J. Discret. Math. 35(2): 1287-1297 (2021) - [j40]Edita Mácajová, Martin Skoviera:
Cubic Graphs with No Short Cycle Covers. SIAM J. Discret. Math. 35(3): 2223-2233 (2021) - 2020
- [j39]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277: 139-162 (2020)
2010 – 2019
- 2019
- [j38]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16(2): 277-298 (2019) - [j37]Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová:
Shorter signed circuit covers of graphs. J. Graph Theory 92(1): 39-56 (2019) - [j36]Edita Mácajová, Edita Rollová, Martin Skoviera:
Circuit Covers of Signed Eulerian Graphs. SIAM J. Discret. Math. 33(2): 933-957 (2019) - [i4]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. CoRR abs/1901.10911 (2019) - 2017
- [j35]Edita Mácajová, Martin Skoviera:
Odd Decompositions of Eulerian Graphs. SIAM J. Discret. Math. 31(3): 1923-1936 (2017) - [j34]Edita Mácajová, Martin Skoviera:
Nowhere-Zero Flows on Signed Eulerian Graphs. SIAM J. Discret. Math. 31(3): 1937-1952 (2017) - [i3]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR abs/1712.07867 (2017) - 2016
- [j33]Edita Mácajová, André Raspaud, Martin Skoviera:
The Chromatic Number of a Signed Graph. Electron. J. Comb. 23(1): 1 (2016) - [j32]Edita Mácajová, Martin Skoviera:
Characteristic Flows on Signed Graphs and Short Circuit Covers. Electron. J. Comb. 23(3): 3 (2016) - [j31]Edita Mácajová, André Raspaud, Edita Rollová, Martin Skoviera:
Circuit Covers of Signed Graphs. J. Graph Theory 81(2): 120-133 (2016) - [j30]Edita Mácajová, Ján Mazák:
Cubic Graphs with Large Circumference Deficit. J. Graph Theory 82(4): 433-440 (2016) - 2015
- [j29]Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small Snarks with Large Oddness. Electron. J. Comb. 22(1): 1 (2015) - [j28]Edita Mácajová, Martin Skoviera:
Remarks on nowhere-zero flows in signed cubic graphs. Discret. Math. 338(5): 809-815 (2015) - [j27]Edita Mácajová, Eckhard Steffen:
The difference between the circular and the integer flow number of bidirected graphs. Discret. Math. 338(6): 866-867 (2015) - [j26]Edita Mácajová, Edita Rollová:
Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs. J. Graph Theory 78(2): 108-130 (2015) - 2014
- [j25]Edita Mácajová, Martin Skoviera:
Sparsely intersecting perfect matchings in cubic graphs. Comb. 34(1): 61-94 (2014) - [j24]Barbora Candráková, Edita Mácajová:
k-Regular graphs with the circular chromatic index close to k. Discret. Math. 322: 19-25 (2014) - 2013
- [j23]Edita Mácajová, Ján Mazák:
On even cycle decompositions of 4-regular line graphs. Discret. Math. 313(17): 1697-1699 (2013) - [j22]Ján Karabás, Edita Mácajová, Roman Nedela:
6-decomposition of snarks. Eur. J. Comb. 34(1): 111-122 (2013) - [j21]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): 163-181 (2013) - [j20]Edita Mácajová:
Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable. SIAM J. Discret. Math. 27(2): 757-767 (2013) - [i2]Edita Mácajová, Ján Mazák:
Cubic graphs with large circumference deficit. CoRR abs/1310.1042 (2013) - 2012
- [j19]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): 2131-2134 (2012) - [j18]Lars Døvling Andersen, Edita Mácajová, Ján Mazák:
Optimal acyclic edge-coloring of cubic graphs. J. Graph Theory 71(4): 353-364 (2012) - [i1]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small snarks with large oddness. CoRR abs/1212.3641 (2012) - 2011
- [j17]Edita Mácajová, Martin Skoviera:
Determining the flow numbers of signed eulerian graphs. Electron. Notes Discret. Math. 38: 585-590 (2011) - [j16]Edita Mácajová, Edita Rollová:
On the flow numbers of signed complete and complete bipartite graphs. Electron. Notes Discret. Math. 38: 591-596 (2011) - [j15]Edita Mácajová, Martin Skoviera:
Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7. Graphs Comb. 27(2): 231-241 (2011) - [j14]Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68(4): 340-348 (2011) - [c1]Edita Mácajová, Ján Mazák:
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs. FAW-AAIM 2011: 136-146 - 2010
- [j13]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 B 100(4): 351-358 (2010)
2000 – 2009
- 2009
- [j12]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): 53-69 (2009) - [j11]Mike J. Grannell, Terry S. Griggs, Edita Mácajová, Martin Skoviera:
Wilson-Schreiber Colourings of Cubic Graphs. Electron. Notes Discret. Math. 34: 225-229 (2009) - [j10]Edita Mácajová, Martin Skoviera:
On a Conjecture of Fan and Raspaud. Electron. Notes Discret. Math. 34: 237-241 (2009) - [j9]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: 525-529 (2009) - 2007
- [j8]Edita Mácajová, Martin Skoviera:
Constructing Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. J. Comb. 14(1) (2007) - [j7]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: 17-21 (2007) - [j6]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: 23-27 (2007) - 2006
- [j5]Edita Mácajová, Martin Skoviera:
Irreducible snarks of given order and cyclic connectivity. Discret. Math. 306(8-9): 779-791 (2006) - [j4]Edita Mácajová, Martin Skoviera:
Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6. Electron. Notes Discret. Math. 24: 125-132 (2006) - [j3]Edita Mácajová, André Raspaud:
On the strong circular 5-flow conjecture. J. Graph Theory 52(4): 307-316 (2006) - 2005
- [j2]Edita Mácajová, André Raspaud, Martin Skoviera:
Abelian Colourings of Cubic Graphs. Electron. Notes Discret. Math. 22: 333-339 (2005) - [j1]Edita Mácajová, Martin Skoviera:
Fano colourings of cubic graphs and the Fulkerson Conjecture. Theor. Comput. Sci. 349(1): 112-120 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
