default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Madaras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Tomás Madaras
, Daniela Matisová, Alfred Onderko, Zuzana Sárosiová:
Proper interval vertex colorings of graphs. Appl. Math. Comput. 477: 128813 (2024)- 2022
- [j32]Katarína Cekanová, Tomás Madaras:
On the structure of essentially-highly-connected polyhedral graphs. Discret. Appl. Math. 321: 308-315 (2022) - [j31]Július Czap, Stanislav Jendrol', Tomás Madaras:
Facial Visibility in Edge Colored Plane Graphs. Graphs Comb. 38(1): 4 (2022) - 2021
- [j30]Igor Fabrici, Tomás Madaras, Maria Timkova, Nico Van Cleemput, Carol T. Zamfirescu:
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian. Appl. Math. Comput. 392: 125714 (2021) - [j29]Tomás Madaras, Pavol Siroczki:
Minimal graphs with respect to geometric distance realizability. Discuss. Math. Graph Theory 41(1): 65-73 (2021) - [j28]Tomás Madaras, Mária Surimová:
Facial Homogeneous Colouring of Graphs. Symmetry 13(7): 1213 (2021) - 2020
- [j27]Mária Surimová, Borut Luzar, Tomás Madaras:
Adynamic coloring of graphs. Discret. Appl. Math. 284: 224-233 (2020) - [j26]Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu:
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. J. Graph Theory 95(1): 125-137 (2020)
2010 – 2019
- 2019
- [j25]Tomás Madaras, Martina Tamásová:
Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight. Australas. J Comb. 74: 240-252 (2019) - 2017
- [j24]Mária Janicová, Tomás Madaras, Roman Soták, Borut Luzar:
From NMNR-coloring of hypergraphs to homogenous coloring of graphs. Ars Math. Contemp. 12(2): 351-360 (2017) - [j23]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
- [j22]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) - [c1]Jana Coronicová Hurajová, Tomás Madaras:
Revising the Newman-Girvan Algorithm. ITAT 2016: 200-205 - 2014
- [j21]Andrej Gajdos, Mirko Hornák, Peter Hudák, Tomás Madaras:
On the maximum weight of a planar graph of given order and size. Discret. Appl. Math. 177: 101-110 (2014) - 2013
- [j20]Peter Hudák, Tomás Madaras:
On doubly light triangles in plane graphs. Discret. Math. 313(19): 1978-1988 (2013) - 2012
- [j19]Dávid Hudák, Tomás Madaras, Yusuke Suzuki:
On properties of maximal 1-planar graphs. Discuss. Math. Graph Theory 32(4): 737-747 (2012) - 2011
- [j18]Dávid Hudák, Tomás Madaras:
On local properties of 1-planar graphs with high minimum degree. Ars Math. Contemp. 4(2): 245-254 (2011) - [j17]Veronika Kozáková, Tomás Madaras:
On doubly light vertices in plane graphs. Discuss. Math. Graph Theory 31(2): 333-344 (2011) - [j16]Jochen Harant, Stanislav Jendrol', Tomás Madaras:
Upper bounds on the sum of powers of the degrees of a simple planar graph. J. Graph Theory 67(2): 112-123 (2011) - 2010
- [j15]Barbora Ferencová, Tomás Madaras:
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight. Discret. Math. 310(12): 1661-1675 (2010)
2000 – 2009
- 2009
- [j14]Dávid Hudák, Tomás Madaras:
On local structure of 1-planar graphs of minimum degree 5 and girth 4. Discuss. Math. Graph Theory 29(2): 385-400 (2009) - 2007
- [j13]Tomás Madaras, Roman Soták:
More maps of p-gons with a ring of q-gons. Ars Comb. 85 (2007) - [j12]Igor Fabrici, Tomás Madaras:
The structure of 1-planar graphs. Discret. Math. 307(7-8): 854-865 (2007) - [j11]Tomás Madaras, Riste Skrekovski:
Lightness, heaviness and gravity. Discret. Math. 307(7-8): 939-951 (2007) - [j10]Tomás Madaras, Riste Skrekovski, Heinz-Jürgen Voss:
The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. Discret. Math. 307(11-12): 1430-1435 (2007) - [j9]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007) - 2005
- [j8]Daniel Král, Tomás Madaras, Riste Skrekovski:
Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005) - 2004
- [j7]Tomás Madaras, Riste Skrekovski:
Heavy paths, light stars, and big melons. Discret. Math. 286(1-2): 115-131 (2004) - [j6]Tomás Madaras:
On the structure of plane graphs of minimum face size 5. Discuss. Math. Graph Theory 24(3): 403-411 (2004) - 2002
- [j5]Tomás Madaras, Andrea Marcinova:
On the structural result on normal plane maps. Discuss. Math. Graph Theory 22(2): 293-303 (2002) - 2000
- [j4]Tomás Madaras:
Note on the weight of paths in plane triangulations of minimum degree 4 and 5. Discuss. Math. Graph Theory 20(2): 173-180 (2000)
1990 – 1999
- 1999
- [j3]Stanislav Jendrol', Tomás Madaras, Roman Soták, Zsolt Tuza:
On light cycles in plane triangulations. Discret. Math. 197-198: 453-467 (1999) - [j2]Tomás Madaras:
Note on weights of paths in polyhedral graphs. Discret. Math. 203(1-3): 267-269 (1999) - 1996
- [j1]Stanislav Jendrol', Tomás Madaras:
On light subgraphs in plane graphs of minimum degree five. Discuss. Math. Graph Theory 16(2): 207-217 (1996)
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 2024-07-05 20:17 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:
