A graph is collapsible if for every even subset , there is a spanning connected subgraph of whose set of odd degree vertices is . A graph is supereulerian if it contains a spanning closed trail. It is known that every collapsible graph is supereulerian. A graph of order is said to satisfy a Fan-type condition if for each pair of vertices at distance two, where is the girth of , and and are fixed numbers. In this paper, we study the Fan-type conditions for collapsible graphs and supereulerian graphs.