430, Example 8.13 on pg. 431, and Example 8.15 on pg. Give an interpretation with at least two thirsty objects and one juice that makes the expression true. Show all the resulting r facts. Whenever there is a choice of which node to visit next in your depth-first search, choose the node that comes alphabetically first.
G is a path that includes each node of G exactly once.
Show that every complete graph is a Hamiltonian graph. In the city of Koenigsberg there are two islands in a river and 7 bridges. Restate this problem as a graph problem.