Question

Finding a Hamiltonian cycle for the set of RGB colors?

score 473 · Answer 1 · 2015-02-21 22:19:00

473

Views

Finding a Hamiltonian cycle for the set of RGB colors?

Published on 21 Feb 2015 - 22:19

score 635 · Answer 2 · 2015-02-22 06:58:21

635

Views

Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?

Published on 22 Feb 2015 - 6:58

score 107 · Answer 3 · 2015-02-28 00:03:52

107

Views

Insertion into an optimal route – is it still optimal?

Published on 28 Feb 2015 - 0:03

score 751 · Answer 4 · 2026-03-25 11:22:55

751

Views

Examples of non-hamiltonian decomposable graphs

Published on 25 Mar 2026 - 11:22

score 1k · Answer 5 · 2015-03-07 20:52:49

1k

Views

Hamiltonian path in a complement of a tree

Published on 07 Mar 2015 - 20:52

score 674 · Answer 6 · 2015-03-12 17:06:07

674

Views

How many Hamiltonian cycles are there in $K_{10,10}$?

Published on 12 Mar 2015 - 17:06

score 494 · Answer 7 · 2015-03-22 00:46:13

494

Views

Recurrence relationship of Hamiltonian backtracking

Published on 22 Mar 2015 - 0:46

score 59 · Answer 8 · 2015-04-15 15:39:09

59

Views

Cubic 3-edge connected graph which is neither hamiltonian nor hypohamiltonian

Published on 15 Apr 2015 - 15:39

score 32 · Answer 9 · 2015-04-23 23:35:41

32

Views

Given inputs as positive integers $a$,$b$, and $c(i,j)$ where $i,j\leq a$, decide if there is a permutation $\tau$ such that

Published on 23 Apr 2015 - 23:35

score 2.5k · Answer 10 · 2015-04-27 23:25:20

2.5k

Views

Every tournament conatins a hamiltonian path - question about the proof

Published on 27 Apr 2015 - 23:25

score 550 · Answer 11 · 2015-04-28 19:30:29

In a connected graph, if the maximum path you could make is of length 100, and there are two paths of length 100, aren't they the same path?

score 460 · Answer 12 · 2026-03-26 17:31:53

460

Views

Is showing a graph is non-Hamiltonian NP-Complete?

Published on 26 Mar 2026 - 17:31

score 3k · Answer 13 · 2026-03-26 17:31:28

3k

Views

Given that Minimum Spanning Tree is NP-complete show that Hamiltonian Cycle is NP complete

Published on 26 Mar 2026 - 17:31

score 50 · Answer 14 · 2015-06-05 15:58:59

50

Views

Hamiltonian graphs of integers $n$

Published on 05 Jun 2015 - 15:58

score 291 · Answer 15 · 2015-06-06 22:10:04

291

Views

Hamiltonian bipartite graphs

Published on 06 Jun 2015 - 22:10

List Question

Finding a Hamiltonian cycle for the set of RGB colors?

Is there any regular, balanced, connected bipartite graph that does not contain any Hamiltonian cycle?

Insertion into an optimal route – is it still optimal?

Examples of non-hamiltonian decomposable graphs

Hamiltonian path in a complement of a tree

How many Hamiltonian cycles are there in $K_{10,10}$?

Recurrence relationship of Hamiltonian backtracking

Cubic 3-edge connected graph which is neither hamiltonian nor hypohamiltonian

Given inputs as positive integers $a$,$b$, and $c(i,j)$ where $i,j\leq a$, decide if there is a permutation $\tau$ such that

Every tournament conatins a hamiltonian path - question about the proof

In a connected graph, if the maximum path you could make is of length 100, and there are two paths of length 100, aren't they the same path?

Is showing a graph is non-Hamiltonian NP-Complete?

Given that Minimum Spanning Tree is NP-complete show that Hamiltonian Cycle is NP complete

Hamiltonian graphs of integers $n$

Hamiltonian bipartite graphs

Trending Questions

Popular # Hahtags

Popular Questions