default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Soták
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j58]Mária Maceková, Zuzana Sárosiová
, Roman Soták:
Interval vertex coloring. Appl. Math. Comput. 470: 128559 (2024)- [j57]Borut Luzar, Martina Mockovciaková, Roman Soták:
Revisiting semistrong edge-coloring of graphs. J. Graph Theory 105(4): 612-632 (2024) - [i4]Borut Luzar, Jakub Przybylo, Roman Soták:
Degree-balanced decompositions of cubic graphs. CoRR abs/2408.16121 (2024) - 2023
- [j56]Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták:
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. Discret. Appl. Math. 324: 80-92 (2023) - [j55]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) - [j54]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
- [j53]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) - [j52]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) - [i3]Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták:
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. CoRR abs/2202.02570 (2022) - [i2]Borut Luzar, Martina Mockovciaková, Roman Soták:
Revisiting Semistrong Edge-Coloring of Graphs. CoRR abs/2208.13297 (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
- [j51]Premysl Holub, Borut Luzar, Erika Mihaliková, Martina Mockovciaková, Roman Soták:
Star edge-coloring of square grids. Appl. Math. Comput. 392: 125741 (2021) - [j50]Stanislav Jendrol', Roman Soták:
On the cyclic coloring conjecture. Discret. Math. 344(2): 112204 (2021) - [j49]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
- [j48]Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták:
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. 279: 106-117 (2020) - [j47]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) - [j46]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
- [j45]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) - [j44]Mirko Hornák, Stanislav Jendrol', Roman Soták:
Facial incidence colorings of embedded multigraphs. Discuss. Math. Graph Theory 39(1): 81-93 (2019) - [j43]Borut Luzar, Martina Mockovciaková, Roman Soták:
Note on list star edge-coloring of subcubic graphs. J. Graph Theory 90(3): 304-310 (2019) - 2018
- [j42]Borut Luzar, Jakub Przybylo, Roman Soták:
New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. 36(4): 1425-1438 (2018) - 2017
- [j41]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) - [j40]Július Czap, Stanislav Jendrol', Roman Soták:
Facial anagram-free edge-coloring of plane graphs. Discret. Appl. Math. 230: 151-155 (2017) - [j39]Borut Luzar, Martina Mockovciaková, Roman Soták:
On a star chromatic index of subcubic graphs. Electron. Notes Discret. Math. 61: 835-839 (2017) - [j38]Petr Gregor, Borut Luzar, Roman Soták:
Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. 34(1): 174-181 (2017) - 2016
- [j37]Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich:
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - [j36]Petr Gregor, Borut Luzar, Roman Soták:
On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. 213: 93-100 (2016) - [j35]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) - [j34]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) - [j33]L'udmila Bezegová, Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski:
Star Edge Coloring of Some Classes of Graphs. J. Graph Theory 81(1): 73-82 (2016) - 2015
- [j32]Zuzana Farkasová, Roman Soták:
Fractional and circular 1-defective colorings of outerplanar graphs. Australas. J Comb. 63: 1-11 (2015) - [j31]Jaka Kranjc, Borut Luzar, Martina Mockovciaková, Roman Soták:
On a Generalization of Thue Sequences. Electron. J. Comb. 22(2): 2 (2015) - [j30]Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski, Peter Sugerek:
l-facial edge colorings of graphs. Discret. Appl. Math. 181: 193-200 (2015) - [j29]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) - [j28]Gabriela Karafová, Roman Soták:
Generalized fractional total colorings of graphs. Discuss. Math. Graph Theory 35(3): 463-473 (2015) - [j27]Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók, Janka Oravcová, Roman Soták:
Generalized fractional and circular total colorings of graphs. Discuss. Math. Graph Theory 35(3): 517-532 (2015) - [j26]Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Graphs Containing Small Cycles. Graphs Comb. 31(6): 1985-1991 (2015) - [j25]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Cycles in Plane Triangulations. J. Graph Theory 78(4): 248-257 (2015) - 2014
- [j24]Dávid Hudák, Borut Luzar, Roman Soták, Riste Skrekovski:
Strong edge-coloring of planar graphs. Discret. Math. 324: 41-49 (2014) - [j23]Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták:
A note on vertex colorings of plane graphs. Discuss. Math. Graph Theory 34(4): 849-855 (2014) - [j22]Christian Löwenstein, Dieter Rautenbach, Roman Soták:
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs. Discret. Math. Theor. Comput. Sci. 16(1): 7-30 (2014) - [j21]Jaka Kranjc, Borut Luzar, Martina Mockovciaková, Roman Soták:
Note on coloring of double disk graphs. J. Glob. Optim. 60(4): 793-799 (2014) - 2013
- [j20]Martina Mockovciaková, Roman Soták:
Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound. Discret. Math. 313(19): 2000-2006 (2013) - 2012
- [j19]Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski:
Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. 160(9): 1356-1368 (2012) - [j18]Július Czap, Stanislav Jendrol', Frantisek Kardos, Roman Soták:
Facial parity edge colouring of plane pseudographs. Discret. Math. 312(17): 2735-2740 (2012) - 2011
- [j17]Peter Mihók, Janka Oravcová, Roman Soták:
Generalized circular colouring of graphs. Discuss. Math. Graph Theory 31(2): 345-356 (2011) - [j16]Frédéric Havet, Stanislav Jendrol', Roman Soták, Erika Skrabul'áková:
Facial non-repetitive edge-coloring of plane graphs. J. Graph Theory 66(1): 38-48 (2011) - 2010
- [j15]Stanislav Jendrol', Jozef Miskuf, Roman Soták:
Total edge irregularity strength of complete graphs and complete bipartite graphs. Discret. Math. 310(3): 400-407 (2010) - [j14]Róbert Hajduk, Roman Soták:
On large light graphs in families of polyhedral graphs. Discret. Math. 310(3): 417-422 (2010) - [j13]Mirko Hornák, Roman Soták:
General neighbour-distinguishing index via chromatic number. Discret. Math. 310(12): 1733-1736 (2010)
2000 – 2009
- 2009
- [j12]Stanislav Jendrol', Jozef Miskuf, Roman Soták, Erika Skrabul'áková:
Rainbow faces in edge-colored plane graphs. J. Graph Theory 62(1): 84-99 (2009) - 2008
- [j11]Janka Rudasová, Roman Soták:
Vertex-distinguishing proper edge colourings of some regular graphs. Discret. Math. 308(5-6): 795-802 (2008) - 2007
- [j10]Tomás Madaras, Roman Soták:
More maps of p-gons with a ring of q-gons. Ars Comb. 85 (2007) - [j9]Stanislav Jendrol', Jozef Miskuf, Roman Soták:
Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs. Electron. Notes Discret. Math. 28: 281-285 (2007) - 2001
- [j8]Matús Harminc, Roman Soták:
Graphs with average labellings. Discret. Math. 233(1-3): 127-132 (2001)
1990 – 1999
- 1999
- [j7]Stanislav Jendrol', Tomás Madaras, Roman Soták, Zsolt Tuza:
On light cycles in plane triangulations. Discret. Math. 197-198: 453-467 (1999) - [j6]Matús Harminc, Roman Soták:
A note on kernels and solutions in digraphs. Discuss. Math. Graph Theory 19(2): 237-240 (1999) - 1997
- [j5]Mirko Hornák, Roman Soták:
Asymptotic behaviour of the observability of Qn. Discret. Math. 176(1-3): 139-148 (1997) - [j4]Mirko Hornák, Roman Soták:
Localization of jumps of the point-distinguishing chromatic index of Kn, n. Discuss. Math. Graph Theory 17(2): 243-251 (1997) - 1996
- [j3]Mirko Hornák, Roman Soták:
The fifth jump of the point-distinguishing chromatic index of Kn, n. Ars Comb. 42 (1996) - 1995
- [j2]Mirko Hornák, Roman Soták:
Observability of complete multipartite graphs with equipotent parts. Ars Comb. 41 (1995) - [j1]Mirko Hornák, Rudolf Lauff, Roman Soták:
On existence of hypergraphs with prescribed edge degree profile. Discret. Math. 146(1-3): 109-121 (1995)
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-10-07 22:19 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:
