2 citations · 5 across the 5 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
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…
math.CO2020★ 2 cited
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 …
math.CO2020★ 1 cited
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\…