計算機數學

(4分) Consider a graph $G = (V,E)$ with vertices $V = \{1,2,3,4,5,6,7\}$ and edges $E = \{(1,2),(2,3),(3,1),(3,4),(4,5),(5,6),(6,4),(4,7)\}$. How many of the following statements are TRUE?

• It is a bipartite graph.
• The length of the longest simple path is 6.
• It has an Euler path.
• It is a planar graph.