![](https://dblp.org/img/logo.320x120.png)
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Mária Maceková
Person information
SPARQL queries ![](https://dblp.org/img/new.blue.24x12.png)
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Mária Maceková, Zuzana Sárosiová
, Roman Soták
:
Interval vertex coloring. Appl. Math. Comput. 470: 128559 (2024) - 2023
- [j12]Borut Luzar
, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. Discret. Appl. Math. 339: 136-148 (2023) - [j11]Katarína Cekanová, Mária Maceková, Zuzana Sárosiová
, Roman Soták
:
Light 3-stars in embedded graphs. Discret. Math. 346(3): 113256 (2023) - 2022
- [j10]Katarína Cekanová, Mária Maceková, Roman Soták
:
Structure of edges of embedded graphs with minimum degree two. J. Graph Theory 101(3): 428-454 (2022) - [i1]Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel:
Locally irregular edge-coloring of subcubic graphs. CoRR abs/2210.04649 (2022) - 2021
- [j9]Katarína Cekanová, Mária Maceková
, Roman Soták
:
Structure of edges in plane graphs with bounded dual edge weight. Discret. Math. 344(8): 112477 (2021) - 2020
- [j8]Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták
:
Incidence coloring-cold cases. Discuss. Math. Graph Theory 40(1): 345-354 (2020)
2010 – 2019
- 2019
- [j7]François Dross, Borut Luzar
, Mária Maceková, Roman Soták
:
Note on 3-choosability of planar graphs with maximum degree 4. Discret. Math. 342(11): 3123-3129 (2019) - 2017
- [j6]Peter Hudák, Mária Maceková, Tomás Madaras, Pavol Siroczki:
More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges. Ars Math. Contemp. 13(2): 355-366 (2017) - 2016
- [j5]Stanislav Jendrol'
, Mária Maceková, Mickaël Montassier, Roman Soták
:
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Discret. Math. 339(2): 780-789 (2016) - [j4]Peter Hudák, Mária Maceková, Tomás Madaras
, Pavol Siroczki:
Light graphs in planar graphs of large girth. Discuss. Math. Graph Theory 36(1): 227-238 (2016) - [j3]Stanislav Jendrol'
, Mária Maceková, Mickaël Montassier, Roman Soták
:
3-path in graphs with bounded average degree. Discuss. Math. Graph Theory 36(2): 339-353 (2016) - 2015
- [j2]Stanislav Jendrol'
, Mária Maceková:
Describing short paths in plane graphs of girth at least 5. Discret. Math. 338(2): 149-158 (2015) - [j1]Stanislav Jendrol'
, Mária Maceková, Roman Soták
:
Note on 3-paths in plane graphs of girth 4. Discret. Math. 338(9): 1643-1648 (2015)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint