Mirko Hornák

54 papers Journal 54
YearRankTypeTitle / Venue / Authors
2024 J jnl
The achromatic number of the Cartesian product of
Discuss. Math. Graph Theory
Mirko Hornák
2023 J jnl
3-facial edge-coloring of plane graphs.
Discret. Math.
Mirko Hornák, Borut Luzar, Kenny Storgel
2023 J jnl
On the achromatic number of the Cartesian product of two complete graphs.
Art Discret. Appl. Math.
Mirko Hornák
2023 J jnl
The achromatic number of K
Discuss. Math. Graph Theory
Mirko Hornák
2021 J jnl
A survey on the cyclic coloring and its relaxations.
Discuss. Math. Graph Theory
Július Czap, Mirko Hornák, Stanislav Jendrol'
2021 J jnl
Facial unique-maximum edge and total coloring of plane graphs.
Discret. Appl. Math.
Igor Fabrici, Mirko Hornák, Simona Rindosová
2019 J jnl
Facial incidence colorings of embedded multigraphs.
Discuss. Math. Graph Theory
Mirko Hornák, Stanislav Jendrol', Roman Soták
2018 J jnl
A note on a directed version of the 1-2-3 Conjecture.
Discret. Appl. Math.
Mirko Hornák, Jakub Przybylo, Mariusz Wozniak
2018 J jnl
On the palette index of complete bipartite graphs.
Discuss. Math. Graph Theory
Mirko Hornák, Juraj Hudák
2016 J jnl
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size.
Graphs Comb.
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2016 J jnl
On the maximum weight of a dense connected graph of given order and size.
Discret. Math.
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2015 J jnl
Edge Colorings of the Direct Product of Two Graphs.
Graphs Comb.
Mirko Hornák, Davide Mazza, Norma Zagaglia Salvi
2015 J jnl
Preface.
Discret. Math.
Mirko Hornák, Zdenek Ryjácek, Martin Skoviera
2015 J jnl
Rainbow Numbers for Cycles in Plane Triangulations.
J. Graph Theory
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták
2014 J jnl
Minimum Number of Palettes in Edge Colorings.
Graphs Comb.
Mirko Hornák, Rafal Kalinowski, Mariusz Meszka, Mariusz Wozniak
2014 J jnl
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory
Mirko Hornák, Danjun Huang, Weifan Wang
2014 J jnl
On the maximum weight of a planar graph of given order and size.
Discret. Appl. Math.
Andrej Gajdos, Mirko Hornák, Peter Hudák, Tomás Madaras
2013 J jnl
On maximum weight of a bipartite graph of given order and size.
Discuss. Math. Graph Theory
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
2013 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2012 J jnl
Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb.
Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
2012 J jnl
On neighbour-distinguishing colourings from lists.
Discret. Math. Theor. Comput. Sci.
Mirko Hornák, Mariusz Wozniak
2010 J jnl
Another step towards proving a conjecture by Plummer and Toft.
Discret. Math.
Mirko Hornák, Jana Zlámalová
2010 J jnl
General neighbour-distinguishing index via chromatic number.
Discret. Math.
Mirko Hornák, Roman Soták
2010 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2009 J jnl
A general upper bound for the cyclic chromatic number of 3-connected plane graphs.
J. Graph Theory
Hikoe Enomoto, Mirko Hornák
2009 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2008 J jnl
General neighbour-distinguishing index of a graph.
Discret. Math.
Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
2008 J jnl
On Planar Graphs Arbitrarily Decomposable into Closed Trails.
Graphs Comb.
Mirko Hornák, Zuzana Kocková
2008 J jnl
On arbitrarily vertex decomposable trees.
Discret. Math.
Mirko Hornák, Mariusz Wozniak
2007 J jnl
A lower bound for on-line ranking number of a path.
Discret. Math.
Erik Bruoth, Mirko Hornák
2007 J jnl
On-line arbitrarily vertex decomposable trees.
Discret. Appl. Math.
Mirko Hornák, Zsolt Tuza, Mariusz Wozniak
2007 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2006 J jnl
On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs.
Ars Comb.
Mirko Hornák, Norma Zagaglia Salvi
2006 J jnl
On neighbour-distinguishing colourings from lists.
Electron. Notes Discret. Math.
Mirko Hornák, Mariusz Wozniak
2006 J jnl
On the Neighbour-Distinguishing Index of a Graph.
Graphs Comb.
Keith Edwards, Mirko Hornák, Mariusz Wozniak
2004 J jnl
On the Achromatic Index of for a Prime
Graphs Comb.
Mirko Hornák, Stefan Pcola, Mariusz Wozniak
2004 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2002 J jnl
Preface.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
2001 J jnl
Achromatic number of
Discret. Math.
Mirko Hornák, Stefan Pcola
2001 J jnl
Cyclic Chromatic Number of 3-Connected Plane Graphs.
SIAM J. Discret. Math.
Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol'
2001 J jnl
Separating 3-cycles in plane triangulations.
Discret. Math.
Jochen Harant, Mirko Hornák, Zdzislaw Skupien
2000 J jnl
On vertex types and cyclic colourings of 3-connected plane graphs.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
1999 J jnl
On a conjecture by Plummer and Toft.
J. Graph Theory
Mirko Hornák, Stanislav Jendrol'
1999 J jnl
On-line ranking number for cycles and paths.
Discuss. Math. Graph Theory
Erik Bruoth, Mirko Hornák
1997 J jnl
Achromatic index of K12.
Ars Comb.
Mirko Hornák
1997 J jnl
Asymptotic behaviour of the observability of Q
Discret. Math.
Mirko Hornák, Roman Soták
1997 J jnl
Localization of jumps of the point-distinguishing chromatic index of K
Discuss. Math. Graph Theory
Mirko Hornák, Roman Soták
1997 J jnl
On the d-distance face chromatic number of plane graphs.
Discret. Math.
Mirko Hornák, Stanislav Jendrol'
1996 J jnl
On (1, 2)-realizable graphs.
Discret. Math.
Peter Bugata, Mirko Hornák, Attila Nagy
1996 J jnl
The fifth jump of the point-distinguishing chromatic index of Kn, n.
Ars Comb.
Mirko Hornák, Roman Soták
1996 J jnl
Unavoidable set of face types for planar maps.
Discuss. Math. Graph Theory
Mirko Hornák, Stanislav Jendrol'
1995 J jnl
Observability of complete multipartite graphs with equipotent parts.
Ars Comb.
Mirko Hornák, Roman Soták
1995 J jnl
On existence of hypergraphs with prescribed edge degree profile.
Discret. Math.
Mirko Hornák, Rudolf Lauff, Roman Soták
1995 J jnl
On some properties of 4-regular plane graphs.
J. Graph Theory
Mirko Hornák, Stanislav Jendrol'