Question

constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?

score 713 · Answer 1 · 2026-05-05 04:13:10

713

Views

constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?

Published on 05 May 2026 - 4:13

score 73 · Answer 2 · 2026-04-29 12:56:07

73

Views

Most efficient way to detect if a series of n edges creates a cycle of size n.

Published on 29 Apr 2026 - 12:56

score 501 · Answer 3 · 2026-05-05 18:28:57

501

Views

Is it true that every graph with $n$ vertices in which $\delta(G)\geq\frac{n}{2}-1$ has Hamiltionian path?

Published on 05 May 2026 - 18:28

score 2.8k · Answer 4 · 2026-05-05 18:27:16

Prove that if a graph $G$ has a Hamilton path then for every $S \subseteq V(G)$ the number of components of $G - S$ is at most $|S| + 1$

score 1.2k · Answer 5 · 2026-05-05 19:06:24

1.2k

Views

Using Ore's theorem to show the graph contains a Hamilton cycle

Published on 05 May 2026 - 19:06

score 647 · Answer 6 · 2026-05-05 16:23:18

647

Views

Graph Theory: Hamilton Cycle Definition Clarification

Published on 05 May 2026 - 16:23

score 252 · Answer 7 · 2026-04-21 07:54:03

252

Views

Does this graph have a Hamiltonian cycle?

Published on 21 Apr 2026 - 7:54

score 380 · Answer 8 · 2026-05-03 10:37:35

380

Views

Show the NP completeness of Hamiltonian Path with the knowledge of an directed Euler graph

Published on 03 May 2026 - 10:37

score 155 · Answer 9 · 2026-05-05 18:28:46

155

Views

Finding Hamiltonian cycle for $N\times M$ grid where $N$ is even

Published on 05 May 2026 - 18:28

score 256 · Answer 10 · 2026-05-05 16:28:18

256

Views

Graph Theory - Hamiltonian Cycle, Eulerian Trail and Eulerian circuit

Published on 05 May 2026 - 16:28

score 73 · Answer 11 · 2026-04-29 12:56:16

73

Views

Hamiltonian circuits / graphing

Published on 29 Apr 2026 - 12:56

score 1.8k · Answer 12 · 2026-04-22 20:53:41

1.8k

Views

P/NP reduction (hamiltonian cycle to TSP)

Published on 22 Apr 2026 - 20:53

score 312 · Answer 13 · 2026-05-10 12:53:51

312

Views

How to prove that a non-complete bipartite graph has a Hamiltonian cycle

Published on 10 May 2026 - 12:53

score 615 · Answer 14 · 2026-05-10 12:54:55

615

Views

Proof with induction on $n$ so that the complete graph $K_n$ has $(n-1)!$ hamilton cycle for all $n \geq 3$.

Published on 10 May 2026 - 12:54

score 146 · Answer 15 · 2026-05-10 12:51:53

146

Views

Traveling salesman problem

Published on 10 May 2026 - 12:51

List Question

constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?

Most efficient way to detect if a series of n edges creates a cycle of size n.

Is it true that every graph with $n$ vertices in which $\delta(G)\geq\frac{n}{2}-1$ has Hamiltionian path?

Prove that if a graph $G$ has a Hamilton path then for every $S \subseteq V(G)$ the number of components of $G - S$ is at most $|S| + 1$

Using Ore's theorem to show the graph contains a Hamilton cycle

Graph Theory: Hamilton Cycle Definition Clarification

Does this graph have a Hamiltonian cycle?

Show the NP completeness of Hamiltonian Path with the knowledge of an directed Euler graph

Finding Hamiltonian cycle for $N\times M$ grid where $N$ is even

Graph Theory - Hamiltonian Cycle, Eulerian Trail and Eulerian circuit

Hamiltonian circuits / graphing

P/NP reduction (hamiltonian cycle to TSP)

How to prove that a non-complete bipartite graph has a Hamiltonian cycle

Proof with induction on $n$ so that the complete graph $K_n$ has $(n-1)!$ hamilton cycle for all $n \geq 3$.

Traveling salesman problem

Trending Questions

Popular # Hahtags

Popular Questions