Which of the following is true of vertex-edge graphs.


(1)They can model real-world problems.
(2)They can all be solved.
(3)Euler paths are the same as Hamilton paths.
(4)All vertices must be used once in Hamilton circuits.