Question

To graph or not to graph, that is the question:

Decomposition and Hamilton Cycles:
Find a Hamilton cycle and a Hamilton path in each of the graphs if they exist in each of these pictures

Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle.

http://prntscr.com/8m1amp

http://prntscr.com/8m1eyy

Answer 1

Graph!

Answer 2

Graph it bby

Answer 3

xD i dint even get a chance to finish my question

Answer 4

lol

Answer 5

Graph y = x

c;

Answer 6

Suppah hard ik

Answer 7

Hamilton cycle for the D graph, its fun :)

Answer 8

whats more fun is eating a bowl of pasta

Answer 9

hahaha xD