Question

Hamiltonian path for a $N\times N$ grid. Focus on all the possible ending points

score 285 · Answer 1 · 2024-01-20 18:28:44

285

Views

Hamiltonian path for a $N\times N$ grid. Focus on all the possible ending points

Published on 20 Jan 2024 - 18:28

score 72 · Answer 2 · 2024-02-11 20:31:10

72

Views

Is there a Hamiltonian cycle of $m$ x $n$ rectangular lattice points (these are the vertices) in $\mathbb{R}^2$ such that no two edges are parallel?

Published on 11 Feb 2024 - 20:31

score 84 · Answer 3 · 2026-03-25 12:48:52

84

Views

Does the graph have a Hamiltonian circuit or a Hamiltonian path?

Published on 25 Mar 2026 - 12:48

score 99 · Answer 4 · 2024-02-20 08:43:23

A polynomial time algorithm for Finding a Hamiltonian path in an undirected graph - searching for a counter example

score 39 · Answer 5 · 2024-02-21 17:37:29

39

Views

A question about tournaments containing Hamilton paths

Published on 21 Feb 2024 - 17:37

score 339 · Answer 6 · 2024-03-03 14:59:16

339

Views

Arranging Drilled Unit Cubes into a Rectangular Prism Without Breaking the Thread

Published on 03 Mar 2024 - 14:59

score 20 · Answer 7 · 2024-03-20 09:38:12

20

Views

What is the smallest untraceable graph satisfying some necessary conditions for traceability?

Published on 20 Mar 2024 - 9:38

score 30 · Answer 8 · 2026-03-26 06:10:34

30

Views

Does a strongly connected component necessarily have a Hamiltonian path or cycle?

Published on 26 Mar 2026 - 6:10

score 555 · Answer 9 · 2015-01-10 07:27:30

555

Views

Showing that a graph doesn't contain a Hamiltonian ccle

Published on 10 Jan 2015 - 7:27

score 1.5k · Answer 10 · 2015-01-13 15:30:22

1.5k

Views

A $3 \times 3 \times 3$ cube has no Hamiltonian path starting at the corner.

Published on 13 Jan 2015 - 15:30

score 1.2k · Answer 11 · 2015-01-21 15:10:09

1.2k

Views

Probability of choosing a graph with Hamiltonian cycle

Published on 21 Jan 2015 - 15:10

score 46 · Answer 12 · 2015-02-04 17:11:01

46

Views

Hamiltonian cycle in shared-digit graph

Published on 04 Feb 2015 - 17:11

score 2k · Answer 13 · 2026-03-25 14:20:55

2k

Views

Reduce Hamiltonian Path to CNF SAT

Published on 25 Mar 2026 - 14:20

score 745 · Answer 14 · 2015-02-16 18:47:44

745

Views

min degree at least $n+1/2$, every edge on Hamilton cycle

Published on 16 Feb 2015 - 18:47

score 500 · Answer 15 · 2015-02-19 10:39:35

500

Views

Hamiltonian Weighted Graph and Decision Problems

Published on 19 Feb 2015 - 10:39

List Question

Hamiltonian path for a $N\times N$ grid. Focus on all the possible ending points

Is there a Hamiltonian cycle of $m$ x $n$ rectangular lattice points (these are the vertices) in $\mathbb{R}^2$ such that no two edges are parallel?

Does the graph have a Hamiltonian circuit or a Hamiltonian path?

A polynomial time algorithm for Finding a Hamiltonian path in an undirected graph - searching for a counter example

A question about tournaments containing Hamilton paths

Arranging Drilled Unit Cubes into a Rectangular Prism Without Breaking the Thread

What is the smallest untraceable graph satisfying some necessary conditions for traceability?

Does a strongly connected component necessarily have a Hamiltonian path or cycle?

Showing that a graph doesn't contain a Hamiltonian ccle

A $3 \times 3 \times 3$ cube has no Hamiltonian path starting at the corner.

Probability of choosing a graph with Hamiltonian cycle

Hamiltonian cycle in shared-digit graph

Reduce Hamiltonian Path to CNF SAT

min degree at least $n+1/2$, every edge on Hamilton cycle

Hamiltonian Weighted Graph and Decision Problems

Trending Questions

Popular # Hahtags

Popular Questions