Question

The existance of a cycle of length $n/2$ in a simple graph is NP-Complete

score 1.1k · Answer 1 · 2017-06-02 15:30:04

1.1k

Views

The existance of a cycle of length $n/2$ in a simple graph is NP-Complete

Published on 02 Jun 2017 - 15:30

score 991 · Answer 2 · 2026-03-26 01:21:01

991

Views

Knight's tour problem existance proof

Published on 26 Mar 2026 - 1:21

score 172 · Answer 3 · 2026-03-26 15:17:22

172

Views

Prove: Let $T$ be a tree, show that each Hamiltonian path is also Eulerian

Published on 26 Mar 2026 - 15:17

score 1.1k · Answer 4 · 2026-03-26 09:16:32

1.1k

Views

Prove that a tournament with exactly one Hamlitonian path cannot have a length-three cycle

Published on 26 Mar 2026 - 9:16

score 385 · Answer 5 · 2017-07-11 07:37:43

385

Views

Hamiltonian cycles in the square of a caterpillar tree

Published on 11 Jul 2017 - 7:37

score 673 · Answer 6 · 2017-07-17 21:17:33

673

Views

Can a worm eat its way through a $3\cdot3 \cdot3$ cube divided into $27$ cubelets if it starts in the center cube?

Published on 17 Jul 2017 - 21:17

score 548 · Answer 7 · 2017-08-03 20:55:21

548

Views

Pigeonhole principle in Ore theorem

Published on 03 Aug 2017 - 20:55

score 26 · Answer 8 · 2017-08-14 08:25:46

26

Views

Mathematical reasons whether to parametrize a shape-to-be-sampled-from via a path and sample its domain or do rejection sampling?

Published on 14 Aug 2017 - 8:25

score 218 · Answer 9 · 2017-08-17 03:06:55

218

Views

If ordered pairs eliminate combinatins of ordered numbers, how many combinations are left?

Published on 17 Aug 2017 - 3:06

score 2.8k · Answer 10 · 2017-08-17 03:07:11

2.8k

Views

Finding the number of Hamiltonian cycles for a cubical graph

Published on 17 Aug 2017 - 3:07

score 68 · Answer 11 · 2026-03-25 17:20:06

68

Views

Show that for each $2<p<q<k$, $Q_k$ has a cycle of length $2^p+2^q$.

Published on 25 Mar 2026 - 17:20

score 2.5k · Answer 12 · 2017-09-05 11:38:57

2.5k

Views

For what values of $n$ does $Q_n$ have a Hamiltonian circuit?

Published on 05 Sep 2017 - 11:38

score 2.3k · Answer 13 · 2026-03-26 15:16:23

2.3k

Views

Graphs that are non-Eulerian but are Hamiltonian

Published on 26 Mar 2026 - 15:16

score 3.1k · Answer 14 · 2017-09-24 06:39:32

3.1k

Views

Showing that a graph doesn't contain a hamiltonian path

Published on 24 Sep 2017 - 6:39

score 58 · Answer 15 · 2026-03-26 09:37:26

58

Views

Removing path of a connected graph.

Published on 26 Mar 2026 - 9:37

List Question

The existance of a cycle of length $n/2$ in a simple graph is NP-Complete

Knight's tour problem existance proof

Prove: Let $T$ be a tree, show that each Hamiltonian path is also Eulerian

Prove that a tournament with exactly one Hamlitonian path cannot have a length-three cycle

Hamiltonian cycles in the square of a caterpillar tree

Can a worm eat its way through a $3\cdot3 \cdot3$ cube divided into $27$ cubelets if it starts in the center cube?

Pigeonhole principle in Ore theorem

Mathematical reasons whether to parametrize a shape-to-be-sampled-from via a path and sample its domain or do rejection sampling?

If ordered pairs eliminate combinatins of ordered numbers, how many combinations are left?

Finding the number of Hamiltonian cycles for a cubical graph

Show that for each $2<p<q<k$, $Q_k$ has a cycle of length $2^p+2^q$.

For what values of $n$ does $Q_n$ have a Hamiltonian circuit?

Graphs that are non-Eulerian but are Hamiltonian

Showing that a graph doesn't contain a hamiltonian path

Removing path of a connected graph.

Trending Questions

Popular # Hahtags

Popular Questions