default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMirko Hornák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j54]Mirko Hornák
:
The achromatic number of the Cartesian product of K6 and Kq. Discuss. Math. Graph Theory 44(2): 411 (2024)- 2023
- [j53]Mirko Hornák:
On the achromatic number of the Cartesian product of two complete graphs. Art Discret. Appl. Math. 7(1): 1 (2023) - [j52]Mirko Hornák, Borut Luzar, Kenny Storgel:
3-facial edge-coloring of plane graphs. Discret. Math. 346(5): 113312 (2023) - [j51]Mirko Hornák:
The achromatic number of K6 square Kq equals 2q+3 if q≥41 is odd. Discuss. Math. Graph Theory 43(4): 1103-1121 (2023) - 2021
- [j50]Igor Fabrici, Mirko Hornák, Simona Rindosová:
Facial unique-maximum edge and total coloring of plane graphs. Discret. Appl. Math. 291: 171-179 (2021) - [j49]Július Czap, Mirko Hornák, Stanislav Jendrol':
A survey on the cyclic coloring and its relaxations. Discuss. Math. Graph Theory 41(1): 5-38 (2021) - 2019
- [j48]Mirko Hornák, Stanislav Jendrol', Roman Soták:
Facial incidence colorings of embedded multigraphs. Discuss. Math. Graph Theory 39(1): 81-93 (2019) - 2018
- [j47]Mirko Hornák, Jakub Przybylo, Mariusz Wozniak:
A note on a directed version of the 1-2-3 Conjecture. Discret. Appl. Math. 236: 472-476 (2018) - [j46]Mirko Hornák, Juraj Hudák:
On the palette index of complete bipartite graphs. Discuss. Math. Graph Theory 38(2): 463-476 (2018) - 2016
- [j45]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the maximum weight of a dense connected graph of given order and size. Discret. Math. 339(7): 1978-1984 (2016) - [j44]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. Graphs Comb. 32(3): 997-1012 (2016) - 2015
- [j43]Mirko Hornák, Zdenek Ryjácek, Martin Skoviera:
Preface. Discret. Math. 338(10): 1659 (2015) - [j42]Mirko Hornák, Davide Mazza, Norma Zagaglia Salvi:
Edge Colorings of the Direct Product of Two Graphs. Graphs Comb. 31(4): 975-992 (2015) - [j41]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
- [j40]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) - [j39]Mirko Hornák, Rafal Kalinowski, Mariusz Meszka, Mariusz Wozniak:
Minimum Number of Palettes in Edge Colorings. Graphs Comb. 30(3): 619-626 (2014) - [j38]Mirko Hornák, Danjun Huang, Weifan Wang:
On Neighbor-Distinguishing Index of Planar Graphs. J. Graph Theory 76(4): 262-278 (2014) - 2013
- [j37]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 313(19): 1833-1834 (2013) - [j36]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On maximum weight of a bipartite graph of given order and size. Discuss. Math. Graph Theory 33(1): 147-165 (2013) - 2012
- [j35]Mirko Hornák, Mariusz Wozniak:
On neighbour-distinguishing colourings from lists. Discret. Math. Theor. Comput. Sci. 14(2): 21-28 (2012) - [j34]Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28(6): 807-821 (2012) - 2010
- [j33]Mirko Hornák, Jana Zlámalová:
Another step towards proving a conjecture by Plummer and Toft. Discret. Math. 310(3): 442-452 (2010) - [j32]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 310(9): 1407 (2010) - [j31]Mirko Hornák, Roman Soták:
General neighbour-distinguishing index via chromatic number. Discret. Math. 310(12): 1733-1736 (2010) - 2009
- [j30]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 309(15): 4889 (2009) - [j29]Hikoe Enomoto, Mirko Hornák:
A general upper bound for the cyclic chromatic number of 3-connected plane graphs. J. Graph Theory 62(1): 1-25 (2009) - 2008
- [j28]Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak:
General neighbour-distinguishing index of a graph. Discret. Math. 308(5-6): 827-831 (2008) - [j27]Mirko Hornák, Mariusz Wozniak:
On arbitrarily vertex decomposable trees. Discret. Math. 308(7): 1268-1281 (2008) - [j26]Mirko Hornák, Zuzana Kocková:
On Planar Graphs Arbitrarily Decomposable into Closed Trails. Graphs Comb. 24(1): 19-28 (2008) - 2007
- [j25]Mirko Hornák, Zsolt Tuza, Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees. Discret. Appl. Math. 155(11): 1420-1429 (2007) - [j24]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 307(7-8): 787 (2007) - [j23]Erik Bruoth, Mirko Hornák:
A lower bound for on-line ranking number of a path. Discret. Math. 307(11-12): 1347-1355 (2007) - 2006
- [j22]Mirko Hornák, Norma Zagaglia Salvi:
On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs. Ars Comb. 80 (2006) - [j21]Mirko Hornák, Mariusz Wozniak:
On neighbour-distinguishing colourings from lists. Electron. Notes Discret. Math. 24: 295-297 (2006) - [j20]Keith Edwards, Mirko Hornák, Mariusz Wozniak:
On the Neighbour-Distinguishing Index of a Graph. Graphs Comb. 22(3): 341-350 (2006) - 2004
- [j19]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 286(1-2): 1- (2004) - [j18]Mirko Hornák, Stefan Pcola, Mariusz Wozniak:
On the Achromatic Index of for a Prime q. Graphs Comb. 20(2): 191-203 (2004) - 2002
- [j17]Mirko Hornák, Stanislav Jendrol':
Preface. Discret. Math. 251(1-3): 1- (2002) - 2001
- [j16]Mirko Hornák, Stefan Pcola:
Achromatic number of K5?Kn for large n. Discret. Math. 234(1-3): 159-169 (2001) - [j15]Jochen Harant, Mirko Hornák, Zdzislaw Skupien:
Separating 3-cycles in plane triangulations. Discret. Math. 239(1-3): 127-136 (2001) - [j14]Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol':
Cyclic Chromatic Number of 3-Connected Plane Graphs. SIAM J. Discret. Math. 14(1): 121-137 (2001) - 2000
- [j13]Mirko Hornák, Stanislav Jendrol':
On vertex types and cyclic colourings of 3-connected plane graphs. Discret. Math. 212(1-2): 101-109 (2000) - 1999
- [j12]Erik Bruoth, Mirko Hornák:
On-line ranking number for cycles and paths. Discuss. Math. Graph Theory 19(2): 175-197 (1999) - [j11]Mirko Hornák, Stanislav Jendrol':
On a conjecture by Plummer and Toft. J. Graph Theory 30(3): 177-189 (1999) - 1997
- [j10]Mirko Hornák:
Achromatic index of K12. Ars Comb. 45 (1997) - [j9]Mirko Hornák, Stanislav Jendrol':
On the d-distance face chromatic number of plane graphs. Discret. Math. 164(1-3): 171-174 (1997) - [j8]Mirko Hornák, Roman Soták:
Asymptotic behaviour of the observability of Qn. Discret. Math. 176(1-3): 139-148 (1997) - [j7]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
- [j6]Mirko Hornák, Roman Soták:
The fifth jump of the point-distinguishing chromatic index of Kn, n. Ars Comb. 42 (1996) - [j5]Peter Bugata, Mirko Hornák, Attila Nagy:
On (1, 2)-realizable graphs. Discret. Math. 158(1-3): 37-47 (1996) - [j4]Mirko Hornák, Stanislav Jendrol':
Unavoidable set of face types for planar maps. Discuss. Math. Graph Theory 16(2): 123-141 (1996) - 1995
- [j3]Mirko Hornák, Roman Soták:
Observability of complete multipartite graphs with equipotent parts. Ars Comb. 41 (1995) - [j2]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) - [j1]Mirko Hornák, Stanislav Jendrol':
On some properties of 4-regular plane graphs. J. Graph Theory 20(2): 163-175 (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-08-05 20: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:
