Question

Prove that if $G$ is a tree, then $G^3$ is Hamiltonian.

score 1.3k · Answer 1 · 2026-03-27 06:07:50

1.3k

Views

Prove that if $G$ is a tree, then $G^3$ is Hamiltonian.

Published on 27 Mar 2026 - 6:07

score 170 · Answer 2 · 2016-03-28 00:16:32

170

Views

How to define a set of trees recursively?

Published on 28 Mar 2016 - 0:16

score 34 · Answer 3 · 2026-03-25 15:34:00

34

Views

Uniqueness of spanning trees made using search algorithms?

Published on 25 Mar 2026 - 15:34

score 818 · Answer 4 · 2016-04-03 18:05:08

818

Views

Maximum number of strict binary trees that can be made, each having exactly n leaf nodes.

Published on 03 Apr 2016 - 18:05

score 793 · Answer 5 · 2016-04-03 23:05:22

793

Views

Verify directly that are exactly 125 labelled trees on 5 vertices.

Published on 03 Apr 2016 - 23:05

score 193 · Answer 6 · 2016-04-07 01:09:17

193

Views

Infinite graph theory: What's a tree?

Published on 07 Apr 2016 - 1:09

score 710 · Answer 7 · 2016-04-11 08:33:18

710

Views

Minimum spanning tree of graph? proof by contradiction?

Published on 11 Apr 2016 - 8:33

score 2.7k · Answer 8 · 2016-04-11 14:00:28

2.7k

Views

Proving the number of leaves of a tree. (Graph Theory)

Published on 11 Apr 2016 - 14:00

score 3.3k · Answer 9 · 2016-04-14 15:06:27

3.3k

Views

You can always delete a vertex from a tree $G$ such that the remaining connected components have size at most $|V(G)|/2$.

Published on 14 Apr 2016 - 15:06

score 235 · Answer 10 · 2016-04-15 16:13:44

235

Views

Treewidth Of Graphs And Chordal Completion

Published on 15 Apr 2016 - 16:13

score 69 · Answer 11 · 2016-04-16 07:48:08

69

Views

Finding the probability using a tree.

Published on 16 Apr 2016 - 7:48

score 52 · Answer 12 · 2016-04-19 20:51:20

52

Views

Question about theorem with trees

Published on 19 Apr 2016 - 20:51

score 2.9k · Answer 13 · 2016-04-20 06:19:39

2.9k

Views

How to prove that each edge of tree is a bridge?

Published on 20 Apr 2016 - 6:19

score 139 · Answer 14 · 2016-04-20 15:25:03

139

Views

Show that in a binary tree, if B is the number of branch points (including the root) and L is the number of leaves, then one has the relation L = 1+B

Published on 20 Apr 2016 - 15:25

score 1.1k · Answer 15 · 2016-04-20 20:19:49

1.1k

Views

Constructing a computably infinite tree with no computable infinite branches using PA

Published on 20 Apr 2016 - 20:19

List Question

Prove that if $G$ is a tree, then $G^3$ is Hamiltonian.

How to define a set of trees recursively?

Uniqueness of spanning trees made using search algorithms?

Maximum number of strict binary trees that can be made, each having exactly n leaf nodes.

Verify directly that are exactly 125 labelled trees on 5 vertices.

Infinite graph theory: What's a tree?

Minimum spanning tree of graph? proof by contradiction?

Proving the number of leaves of a tree. (Graph Theory)

You can always delete a vertex from a tree $G$ such that the remaining connected components have size at most $|V(G)|/2$.

Treewidth Of Graphs And Chordal Completion

Finding the probability using a tree.

Question about theorem with trees

How to prove that each edge of tree is a bridge?

Show that in a binary tree, if B is the number of branch points (including the root) and L is the number of leaves, then one has the relation L = 1+B

Constructing a computably infinite tree with no computable infinite branches using PA

Trending Questions

Popular # Hahtags

Popular Questions