Edita Mácajová
Orcid: 0000-0001-5735-5513
According to our database1,
Edita Mácajová
authored at least 57 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Comb., February, 2025
2024
Discret. Appl. Math., January, 2024
2023
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.
J. Comb. Theory B, May, 2023
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
2022
J. Graph Theory, 2022
2021
SIAM J. Discret. Math., 2021
J. Comb. Theory B, 2021
Corrigendum to "On even cycle decompositions of 4-regular line graphs" [Discrete Math. 313 (17) (2013) 1697-1699].
Discret. Math., 2021
2020
2019
Ars Math. Contemp., 2019
2017
2016
Electron. J. Comb., 2016
2015
J. Graph Theory, 2015
The difference between the circular and the integer flow number of bidirected graphs.
Discret. Math., 2015
2014
2013
J. Graph Theory, 2013
2012
2011
Electron. Notes Discret. Math., 2011
Electron. Notes Discret. Math., 2011
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011
2010
2009
2007
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems.
Electron. Notes Discret. Math., 2007
Electron. Notes Discret. Math., 2007
Electron. J. Comb., 2007
2006
Electron. Notes Discret. Math., 2006
2005
Theor. Comput. Sci., 2005