Question

CAN SOMEBODY HELP ME FIND A HAMILTON PATH BELOW.

Answer 1

Since circles have no vertices is there a rule for it to? I know we can only go through each vertice once right, mhm this seems pretty interesting.

Answer 2

yes , it has to go through one vertix once

Answer 3

The hint given is that the graph is symmetric around the vertix p

Answer 4

no solution ?

Answer 5

How'd you come up with that

Answer 6

i bruteforced :
Notice that the hamiltonian path, if it exists, contains exactly 15 edges.
We have 27 edges, so total number of choices = \( \binom{27}{15}\)

Answer 7

all of them have repeated vertices, so...

Answer 8

Niceee

Answer 9

im not 100% sure of my method though
@SithsAndGiggles