Constructing connected bicritical graphs with edge-connectivity 2

In this paper, we give a negative answer toward this question; namely, we give a construction of infinitely many connected t-bicritical graphs with edge-connectivity 2 for every integer t≥5. Furthermore, we give some sufficient conditions for a connected 5-bicritical graph to have λ(G)≥3.