The Hamiltonian path

What is Hamiltonian path?

• A Hamiltonian path is a path that visits each vertex of the graph twice.

• A Hamiltonian path is a path that visits each vertex of the graph exactly once.

Does the graph have hampath?

• Yes

• No

Does hampath is NP complete?

• Yes

• No

Does the graph have hampath?

• Yes

• No

What is c1, c2, c3 and ck represent for?

• vertices

• clauses

• variables

• nodes

Tags

CCSS.HSA.CED.A.3

How many vertices in the graph?

• 3

• 5

• 4

• 2

Does the graph TRUE?

• Yes

• No

Does the graph FALSE?

• Yes

• No

Which one is zig-zag path?

• 
• 

Which one is the zag-zig path?

• 
• 

Tags

CCSS.HSF.BF.B.3