Mirko Hornák

Orcid: 0000-0002-3588-8455

According to our database1, Mirko Hornák authored at least 47 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the achromatic number of the Cartesian product of two complete graphs.
Art Discret. Appl. Math., August, 2023

3-facial edge-coloring of plane graphs.
Discret. Math., May, 2023

The achromatic number of K<sub>6</sub> square K<sub>q</sub> equals 2q+3 if q≥41 is odd.
Discuss. Math. Graph Theory, 2023

2021
A survey on the cyclic coloring and its relaxations.
Discuss. Math. Graph Theory, 2021

Facial unique-maximum edge and total coloring of plane graphs.
Discret. Appl. Math., 2021

2019
Facial incidence colorings of embedded multigraphs.
Discuss. Math. Graph Theory, 2019

2018
On the palette index of complete bipartite graphs.
Discuss. Math. Graph Theory, 2018

A note on a directed version of the 1-2-3 Conjecture.
Discret. Appl. Math., 2018

2016
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size.
Graphs Comb., 2016

On the maximum weight of a dense connected graph of given order and size.
Discret. Math., 2016

2015
Rainbow Numbers for Cycles in Plane Triangulations.
J. Graph Theory, 2015

Edge Colorings of the Direct Product of Two Graphs.
Graphs Comb., 2015

Preface.
Discret. Math., 2015

2014
On Neighbor-Distinguishing Index of Planar Graphs.
J. Graph Theory, 2014

Minimum Number of Palettes in Edge Colorings.
Graphs Comb., 2014

On the maximum weight of a planar graph of given order and size.
Discret. Appl. Math., 2014

2013
On maximum weight of a bipartite graph of given order and size.
Discuss. Math. Graph Theory, 2013

2012
Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb., 2012

2010
Another step towards proving a conjecture by Plummer and Toft.
Discret. Math., 2010

General neighbour-distinguishing index via chromatic number.
Discret. Math., 2010

Preface.
Discret. Math., 2010

2009
A general upper bound for the cyclic chromatic number of 3-connected plane graphs.
J. Graph Theory, 2009

2008
On Planar Graphs Arbitrarily Decomposable into Closed Trails.
Graphs Comb., 2008

On arbitrarily vertex decomposable trees.
Discret. Math., 2008

General neighbour-distinguishing index of a graph.
Discret. Math., 2008

2007
A lower bound for on-line ranking number of a path.
Discret. Math., 2007

On-line arbitrarily vertex decomposable trees.
Discret. Appl. Math., 2007

2006
On the Neighbour-Distinguishing Index of a Graph.
Graphs Comb., 2006

On neighbour-distinguishing colourings from lists.
Electron. Notes Discret. Math., 2006

On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs.
Ars Comb., 2006

2004
On the Achromatic Index of for a Prime <i>q</i>.
Graphs Comb., 2004

2001
Cyclic Chromatic Number of 3-Connected Plane Graphs.
SIAM J. Discret. Math., 2001

Achromatic number of <i>K</i><sub>5</sub>?<i>K</i><sub>n</sub> for large <i>n</i>.
Discret. Math., 2001

Separating 3-cycles in plane triangulations.
Discret. Math., 2001

2000
On vertex types and cyclic colourings of 3-connected plane graphs.
Discret. Math., 2000

1999
On a conjecture by Plummer and Toft.
J. Graph Theory, 1999

On-line ranking number for cycles and paths.
Discuss. Math. Graph Theory, 1999

1997
Localization of jumps of the point-distinguishing chromatic index of K<sub>n, n</sub>.
Discuss. Math. Graph Theory, 1997

Asymptotic behaviour of the observability of Q<sub>n</sub>.
Discret. Math., 1997

On the d-distance face chromatic number of plane graphs.
Discret. Math., 1997

Achromatic index of K12.
Ars Comb., 1997

1996
Unavoidable set of face types for planar maps.
Discuss. Math. Graph Theory, 1996

On (1, 2)-realizable graphs.
Discret. Math., 1996

The fifth jump of the point-distinguishing chromatic index of Kn, n.
Ars Comb., 1996

1995
On some properties of 4-regular plane graphs.
J. Graph Theory, 1995

On existence of hypergraphs with prescribed edge degree profile.
Discret. Math., 1995

Observability of complete multipartite graphs with equipotent parts.
Ars Comb., 1995


  Loading...