Question

Difficulty in understanding the proof of Petersen Graph is non hamiltonian as given in graph theory text by Chartrand and Zhang

score 576 · Answer 1 · 2026-03-25 19:10:19

576

Views

Difficulty in understanding the proof of Petersen Graph is non hamiltonian as given in graph theory text by Chartrand and Zhang

Published on 25 Mar 2026 - 19:10

score 189 · Answer 2 · 2021-06-23 16:53:52

189

Views

Why are the total (non-distinct) Hamiltonian circuits in complete graph $K_n$ $=$ $(n−1)!$

Published on 23 Jun 2021 - 16:53

score 367 · Answer 3 · 2021-07-15 01:19:52

367

Views

Count Hamiltonian Cycles in directed torus graph

Published on 15 Jul 2021 - 1:19

score 131 · Answer 4 · 2021-07-20 00:57:57

131

Views

Is there a specific name for this necessary condition of Hamiltonian graphs?

Published on 20 Jul 2021 - 0:57

score 379 · Answer 5 · 2021-07-20 10:26:54

379

Views

Is there an algorithm giving the shortest path visiting all nodes in a directed weighted graph?

Published on 20 Jul 2021 - 10:26

score 32 · Answer 6 · 2021-07-31 17:13:06

32

Views

Show that if either N is even and M > 1 or M is even and N > 1, then the N × M grid is Hamiltonian.

Published on 31 Jul 2021 - 17:13

score 108 · Answer 7 · 2021-08-20 16:26:54

108

Views

Prove that $\Delta(G)\le \frac{n-1}{2}$

Published on 20 Aug 2021 - 16:26

score 70 · Answer 8 · 2021-08-24 14:54:23

70

Views

How Many Paths Go From Point A to B Such That Every Space is Passed Through Once

Published on 24 Aug 2021 - 14:54

score 105 · Answer 9 · 2026-03-25 19:04:39

105

Views

A multigraph $G$ has even no of Hamiltonian paths

Published on 25 Mar 2026 - 19:04

score 309 · Answer 10 · 2026-03-27 00:09:29

309

Views

Does the graph contain a Hamiltonian and an Euler cycle?

Published on 27 Mar 2026 - 0:09

score 354 · Answer 11 · 2021-09-24 06:39:38

354

Views

Minimal collection of paths that visit all vertices of a subgraph

Published on 24 Sep 2021 - 6:39

score 222 · Answer 12 · 2021-09-25 17:11:20

222

Views

Prove that, if all perfect matchings in G are pairwise disjoint, than every two perfect matchings contain the edge set of a hamiltonian cycle in G.

Published on 25 Sep 2021 - 17:11

score 54 · Answer 13 · 2021-09-27 12:58:04

54

Views

Size of a path defined on a Hamiltonian cycle

Published on 27 Sep 2021 - 12:58

score 60 · Answer 14 · 2021-10-02 19:32:34

60

Views

Non-isomorphic non-hamiltonian graphs

Published on 02 Oct 2021 - 19:32

score 111 · Answer 15 · 2026-03-25 19:01:40

111

Views

Non hamiltonian cubic graphs

Published on 25 Mar 2026 - 19:01

List Question

Difficulty in understanding the proof of Petersen Graph is non hamiltonian as given in graph theory text by Chartrand and Zhang

Why are the total (non-distinct) Hamiltonian circuits in complete graph $K_n$ $=$ $(n−1)!$

Count Hamiltonian Cycles in directed torus graph

Is there a specific name for this necessary condition of Hamiltonian graphs?

Is there an algorithm giving the shortest path visiting all nodes in a directed weighted graph?

Show that if either N is even and M > 1 or M is even and N > 1, then the N × M grid is Hamiltonian.

Prove that $\Delta(G)\le \frac{n-1}{2}$

How Many Paths Go From Point A to B Such That Every Space is Passed Through Once

A multigraph $G$ has even no of Hamiltonian paths

Does the graph contain a Hamiltonian and an Euler cycle?

Minimal collection of paths that visit all vertices of a subgraph

Prove that, if all perfect matchings in G are pairwise disjoint, than every two perfect matchings contain the edge set of a hamiltonian cycle in G.

Size of a path defined on a Hamiltonian cycle

Non-isomorphic non-hamiltonian graphs

Non hamiltonian cubic graphs

Trending Questions

Popular # Hahtags

Popular Questions