2 citations · 5 across the 5 of their papers we have counts for
5 papers
On the achromatic number of the Cartesian product of two complete graphs
Mirko Horňák
A vertex colouring of a graph is complete if for any with there are in adjacent vertices such that and $f(v…
3-facial edge-coloring of plane graphs
Mirko Horňák, Borut Lužar, Kenny Štorgel
An -facial edge-coloring of a plane graph is a coloring of its edges such that any two edges at distance at most on a boundary walk of any face receive distinct colors…
The achromatic number of is
Mirko Hornak
A vertex colouring of a graph is complete if for any two distinct colours there is an edge such that , . T…
The achromatic number of equals if is odd
Mirko Hornak
Let be a graph and a finite set of colours. A vertex colouring is complete provided that for any two distinct colours there is …
The achromatic number of the Cartesian product of and
Mirko Hornak
Let be a graph and a finite set of colours. A vertex colouring is complete if for any pair of distinct colours one can find an edge $\{v_1,v_2\…