A graph with 555 vertices and 444 edges that is NOT a tree must be:
Bipartite
Planar
Disconnected
Complete