Topological chirality of minimally colored Kuratowski graphs

We prove that topological chirality in a K-3,K-3 graph requires a minimum of two non-adjacent colored edges, while topological chirality in a K-5 graph requires a minimum of three colored edges that form an open path.