Observability of complete multipartite graphs with equipotent parts. - Mirko Hornák; Roman Soták (Ars Comb., 1995)

On existence of hypergraphs with prescribed edge degree profile. - Mirko Hornák; Rudolf Lauff; Roman Soták (Discret. Math., 1995)

On some properties of 4-regular plane graphs. - Mirko Hornák; Stanislav Jendrol' (J. Graph Theory, 1995)

The fifth jump of the point-distinguishing chromatic index of Kn, n. - Mirko Hornák; Roman Soták (Ars Comb., 1996)

On (1, 2)-realizable graphs. - Peter Bugata; Mirko Hornák; Attila Nagy (Discret. Math., 1996)

Unavoidable set of face types for planar maps. - Mirko Hornák; Stanislav Jendrol' (Discuss. Math. Graph Theory, 1996)

Achromatic index of K12. - Mirko Hornák (Ars Comb., 1997)

On the d-distance face chromatic number of plane graphs. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 1997)

Asymptotic behaviour of the observability of Qn. - Mirko Hornák; Roman Soták (Discret. Math., 1997)

Localization of jumps of the point-distinguishing chromatic index of Kn, n. - Mirko Hornák; Roman Soták (Discuss. Math. Graph Theory, 1997)

On-line ranking number for cycles and paths. - Erik Bruoth; Mirko Hornák (Discuss. Math. Graph Theory, 1999)

On a conjecture by Plummer and Toft. - Mirko Hornák; Stanislav Jendrol' (J. Graph Theory, 1999)

On vertex types and cyclic colourings of 3-connected plane graphs. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 2000)

Separating 3-cycles in plane triangulations. - Jochen Harant; Mirko Hornák; Zdzislaw Skupien (Discret. Math., 2001)

Achromatic number of K5?Kn for large n. - Mirko Hornák; Stefan Pcola (Discret. Math., 2001)

Cyclic Chromatic Number of 3-Connected Plane Graphs. - Hikoe Enomoto; Mirko Hornák; Stanislav Jendrol' (SIAM J. Discret. Math., 2001)

On the Achromatic Index of for a Prime q. - Mirko Hornák; Stefan Pcola; Mariusz Wozniak (Graphs Comb., 2004)

On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs. - Mirko Hornák; Norma Zagaglia Salvi (Ars Comb., 2006)

On neighbour-distinguishing colourings from lists. - Mirko Hornák; Mariusz Wozniak (Electron. Notes Discret. Math., 2006)

On the Neighbour-Distinguishing Index of a Graph. - Keith Edwards; Mirko Hornák; Mariusz Wozniak (Graphs Comb., 2006)

On-line arbitrarily vertex decomposable trees. - Mirko Hornák; Zsolt Tuza; Mariusz Wozniak (Discret. Appl. Math., 2007)

A lower bound for on-line ranking number of a path. - Erik Bruoth; Mirko Hornák (Discret. Math., 2007)

Preface. - Mirko Hornák; Stanislav Jendrol' (Discret. Math., 2007)

General neighbour-distinguishing index of a graph. - Ervin Györi; Mirko Hornák; Cory Palmer; Mariusz Wozniak (Discret. Math., 2008)

On arbitrarily vertex decomposable trees. - Mirko Hornák; Mariusz Wozniak (Discret. Math., 2008)

On Planar Graphs Arbitrarily Decomposable into Closed Trails. - Mirko Hornák; Zuzana Kocková (Graphs Comb., 2008)

A general upper bound for the cyclic chromatic number of 3-connected plane graphs. - Hikoe Enomoto; Mirko Hornák (J. Graph Theory, 2009)

General neighbour-distinguishing index via chromatic number. - Mirko Hornák; Roman Soták (Discret. Math., 2010)

Another step towards proving a conjecture by Plummer and Toft. - Mirko Hornák; Jana Zlámalová (Discret. Math., 2010)

Dense Arbitrarily Vertex Decomposable Graphs. - Mirko Hornák; Antoni Marczyk; Ingo Schiermeyer; Mariusz Wozniak (Graphs Comb., 2012)

On maximum weight of a bipartite graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2013)

On the maximum weight of a planar graph of given order and size. - Andrej Gajdos; Mirko Hornák; Peter Hudák; Tomás Madaras (Discret. Appl. Math., 2014)

Minimum Number of Palettes in Edge Colorings. - Mirko Hornák; Rafal Kalinowski; Mariusz Meszka; Mariusz Wozniak (Graphs Comb., 2014)

On Neighbor-Distinguishing Index of Planar Graphs. - Mirko Hornák; Danjun Huang; Weifan Wang 001 (J. Graph Theory, 2014)

Preface. - Mirko Hornák; Zdenek Ryjácek; Martin Skoviera (Discret. Math., 2015)

Edge Colorings of the Direct Product of Two Graphs. - Mirko Hornák; Davide Mazza; Norma Zagaglia Salvi (Graphs Comb., 2015)

Rainbow Numbers for Cycles in Plane Triangulations. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer; Roman Soták (J. Graph Theory, 2015)

On the maximum weight of a dense connected graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discret. Math., 2016)

On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2016)

A note on a directed version of the 1-2-3 Conjecture. - Mirko Hornák; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2018)

On the palette index of complete bipartite graphs. - Mirko Hornák; Juraj Hudák (Discuss. Math. Graph Theory, 2018)

Facial incidence colorings of embedded multigraphs. - Mirko Hornák; Stanislav Jendrol'; Roman Soták (Discuss. Math. Graph Theory, 2019)

Facial unique-maximum edge and total coloring of plane graphs. - Igor Fabrici; Mirko Hornák; Simona Rindosová (Discret. Appl. Math., 2021)

A survey on the cyclic coloring and its relaxations. - Július Czap; Mirko Hornák; Stanislav Jendrol' (Discuss. Math. Graph Theory, 2021)

The achromatic number of K6 square Kq equals 2q+3 if q≥41 is odd. - Mirko Hornák (Discuss. Math. Graph Theory, 2023)

3-facial edge-coloring of plane graphs. - Mirko Hornák; Borut Luzar; Kenny Storgel (Discret. Math., 2023)

On the achromatic number of the Cartesian product of two complete graphs. - Mirko Hornák (Art Discret. Appl. Math., 2023)

The achromatic number of the Cartesian product of K6 and Kq. - Mirko Hornák (Discuss. Math. Graph Theory, 2024)