Question

A little bit more difficult problem regarding rooted plane trees

score 119 · Answer 1 · 2015-05-21 13:51:46

119

Views

A little bit more difficult problem regarding rooted plane trees

Published on 21 May 2015 - 13:51

score 3.8k · Answer 2 · 2026-03-26 21:12:46

3.8k

Views

How do you find the value of n in this example

Published on 26 Mar 2026 - 21:12

score 54 · Answer 3 · 2026-03-26 08:03:31

54

Views

Existence of increasing pair of labeled trees in an infinite sequence

Published on 26 Mar 2026 - 8:03

score 63 · Answer 4 · 2026-03-25 04:38:51

63

Views

Spare storage of a tree

Published on 25 Mar 2026 - 4:38

score 1.6k · Answer 5 · 2015-06-03 07:16:39

1.6k

Views

Algorithm to cut the graph into a tree.

Published on 03 Jun 2015 - 7:16

score 1.5k · Answer 6 · 2015-06-08 16:32:28

1.5k

Views

Condition for a graph to have only one MST (Minimum Spanning Tree)?

Published on 08 Jun 2015 - 16:32

score 699 · Answer 7 · 2015-06-08 17:22:17

699

Views

Prove that in the union of two trees there exist a vertex with degree of at most $3$

Published on 08 Jun 2015 - 17:22

score 503 · Answer 8 · 2015-06-08 19:13:28

503

Views

Proving that the number of appearances of $i$ in $F(T)$ (Prufer sequence) is $d_i-1$

Published on 08 Jun 2015 - 19:13

score 1.3k · Answer 9 · 2015-06-09 16:02:44

1.3k

Views

Proving the number of leaves is larger by at least two than the number of vertices with a degree of at least 3

Published on 09 Jun 2015 - 16:02

score 164 · Answer 10 · 2015-06-11 16:57:50

164

Views

How to determine lexicographically the smallest Prüfer-Code of a spanning tree?

Published on 11 Jun 2015 - 16:57

score 1.2k · Answer 11 · 2026-03-26 09:46:55

1.2k

Views

How to find the number of spanning trees for a cube?

Published on 26 Mar 2026 - 9:46

score 99 · Answer 12 · 2026-03-27 05:34:48

99

Views

Is there a polynomial time algorithm for Poly-trees (oriented trees) isomorphism?

Published on 27 Mar 2026 - 5:34

score 1k · Answer 13 · 2015-06-15 15:48:21

1k

Views

Maximum nodes in AVL tree with distinct positive integers

Published on 15 Jun 2015 - 15:48

score 5.2k · Answer 14 · 2015-06-21 13:48:11

5.2k

Views

How many trees does a forest with n vertices and m edges contain?

Published on 21 Jun 2015 - 13:48

score 2.5k · Answer 15 · 2015-06-22 17:28:03

2.5k

Views

Proof that if all vertices have degree at least two then $G$ contains a cycle

Published on 22 Jun 2015 - 17:28

List Question

A little bit more difficult problem regarding rooted plane trees

How do you find the value of n in this example

Existence of increasing pair of labeled trees in an infinite sequence

Spare storage of a tree

Algorithm to cut the graph into a tree.

Condition for a graph to have only one MST (Minimum Spanning Tree)?

Prove that in the union of two trees there exist a vertex with degree of at most $3$

Proving that the number of appearances of $i$ in $F(T)$ (Prufer sequence) is $d_i-1$

Proving the number of leaves is larger by at least two than the number of vertices with a degree of at least 3

How to determine lexicographically the smallest Prüfer-Code of a spanning tree?

How to find the number of spanning trees for a cube?

Is there a polynomial time algorithm for Poly-trees (oriented trees) isomorphism?

Maximum nodes in AVL tree with distinct positive integers

How many trees does a forest with n vertices and m edges contain?

Proof that if all vertices have degree at least two then $G$ contains a cycle

Trending Questions

Popular # Hahtags

Popular Questions