blockversewordysbillionaire.aiyourlistWhiteboardAppquizieunschool

News

Home
Popular
Elections
Members

Genius — OpenServe

Hamiltonian path — latest news, discussion & facts — IJR

Sponsored

Hamiltonian path

Topic

Hamiltonian path

path in a graph that visits each vertex exactly once

0members1here now

Ask Genius Site

Feed Discussions About

Loading

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About Hamiltonian path

In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. The computational problems of determining whether such paths and cycles exist in graphs are NP-complete; see Hamiltonian path problem for details.

0

members

1

here now

Everything about Hamiltonian path →

Live room · 1 here

Be the first in the room — members see you arrive.

Facts from Wikidata (CC0). Image by Claudio Rocchini via Wikimedia Commons (CC BY 2.5).