Bipartite Graphs and Matchings · Superchallenge problem

A network has vertices $1$–$8$ and connections $12, 23, 13, 36, 26, 67, 78, 68$. What is the least number of connections that must be removed so that the remaining network is bipartite?