Find the shortest path in the graph that starts and ends in a specific node and visits all other nodes exactly once. This kind of a path is also known as a Hamiltonian cycle.
Find the shortest path in the graph that starts and ends in a specific node and visits all other nodes exactly once. This kind of a path is also known as a Hamiltonian cycle.
Color the nodes of a graph with as few colors as possible such that connected nodes don't have the same color.