Which of the following is true of vertex-edge graphs? a.)they can model real-world problems. b.)they can all be solved. c.)euler paths are the same as hamilton paths. d.)all vertices must be used once in hamilton circuits. i didn't know this one, honestly i don't care at the moment. so me on this..

The answer would most definitely be C

This is what i found “answer: a rigid transformation preserves both the side lengths and the angle measures of a polygon. step-by-step explanation: rigid transformations are the transformations which does not affect the size and the shape of figure .” i hope this you for what your looking for. can you plz mark me brainliest?