A connected graph has $100$ vertices, the degrees of all the vertices do not exceed $4$ and no two vertices of degree $4$ are adjacent. Prove that it is possible to remove several edges that have no common vertices from this graph such that there would be no triangles in the resulting graph.