Question

Add smaller Hamiltonian circuits to make bigger one

score 34 · Answer 1 · 2020-07-24 18:59:16

34

Views

Add smaller Hamiltonian circuits to make bigger one

Published on 24 Jul 2020 - 18:59

score 611 · Answer 2 · 2020-07-27 17:57:02

611

Views

Does every regular, bipartite graph contain a Hamiltonian path?

Published on 27 Jul 2020 - 17:57

score 60 · Answer 3 · 2020-07-29 07:44:23

60

Views

Does every $r$-regular, $r$-edge-connected, bipartite graph contain a Hamiltonian path?

Published on 29 Jul 2020 - 7:44

score 78 · Answer 4 · 2026-03-25 10:57:09

78

Views

Do the two order-4 Latin square graphs have the same number of Hamilton cycles?

Published on 25 Mar 2026 - 10:57

score 2.3k · Answer 5 · 2026-03-25 17:40:18

2.3k

Views

Knight tour on $5 \times 5$ incongruence

Published on 25 Mar 2026 - 17:40

score 2.8k · Answer 6 · 2016-09-15 01:39:18

2.8k

Views

(Graph Theory) Prove that $H_n$ has a Hamiltonian cycle for $n$ ≥ 2.

Published on 15 Sep 2016 - 1:39

score 542 · Answer 7 · 2016-09-21 13:27:32

542

Views

Proving perfect graph has no odd cycles of length greater than three

Published on 21 Sep 2016 - 13:27

score 687 · Answer 8 · 2016-10-08 04:23:59

687

Views

hamiltonian cycle need assistance

Published on 08 Oct 2016 - 4:23

score 40 · Answer 9 · 2016-10-12 07:58:33

40

Views

graph is Hamiltonian if the number of vertices with degree at most d is less that d

Published on 12 Oct 2016 - 7:58

score 6.9k · Answer 10 · 2016-10-14 08:30:31

6.9k

Views

Show that 3-regular graph (with Hamiltonian cycle) has chromatic index 3

Published on 14 Oct 2016 - 8:30

score 864 · Answer 11 · 2016-10-16 08:57:09

864

Views

cut-vertex and Hamiltonian graphs

Published on 16 Oct 2016 - 8:57

score 197 · Answer 12 · 2026-03-25 08:09:02

197

Views

Knights tour dfs search with look ahead

Published on 25 Mar 2026 - 8:09

score 760 · Answer 13 · 2026-03-26 06:26:22

760

Views

Reduction Algorithm from Prime Factorization To Hamiltonian Path Problem

Published on 26 Mar 2026 - 6:26

score 103 · Answer 14 · 2016-10-27 03:00:44

Let $C_n$, $C_m$ two cycles, show that $C_n * C_m$ is hamiltonian. Conclude saying that if $G$ and $H$ are hamiltonian then $G x H$ is hamiltonian

score 84 · Answer 15 · 2016-10-30 02:09:28

84

Views

Can it be proven that more than one vertex can individually be removed from a strong tournament and still be strong?

Published on 30 Oct 2016 - 2:09

List Question

Add smaller Hamiltonian circuits to make bigger one

Does every regular, bipartite graph contain a Hamiltonian path?

Does every $r$-regular, $r$-edge-connected, bipartite graph contain a Hamiltonian path?

Do the two order-4 Latin square graphs have the same number of Hamilton cycles?

Knight tour on $5 \times 5$ incongruence

(Graph Theory) Prove that $H_n$ has a Hamiltonian cycle for $n$ ≥ 2.

Proving perfect graph has no odd cycles of length greater than three

hamiltonian cycle need assistance

graph is Hamiltonian if the number of vertices with degree at most d is less that d

Show that 3-regular graph (with Hamiltonian cycle) has chromatic index 3

cut-vertex and Hamiltonian graphs

Knights tour dfs search with look ahead

Reduction Algorithm from Prime Factorization To Hamiltonian Path Problem

Let $C_n$, $C_m$ two cycles, show that $C_n * C_m$ is hamiltonian. Conclude saying that if $G$ and $H$ are hamiltonian then $G x H$ is hamiltonian

Can it be proven that more than one vertex can individually be removed from a strong tournament and still be strong?

Trending Questions

Popular # Hahtags

Popular Questions