Short Answer
Consider the graph at the right.
(a) Does it have an Euler circuit?
(b) Does it have an Euler path?
(c) Does it have a Hamilton circuit?
(d) Does it have a Hamilton path? 
Definitions:
Related Questions
Q5: The vertex-chromatic number for <span
Q11: Refer to the situation described above ;
Q31: Draw a cubic graph with 7 vertices,
Q32: Draw all nonisomorphic trees with 5 vertices.
Q42: <span class="ql-formula" data-value="x + y + z
Q56: <span class="ql-formula" data-value="\text { The relation }
Q67: The bubble sort has complexity O( _
Q98: A planar graph with 10 vertices.
Q141: How many bit strings of length 10
Q148: You pick cards one at a time