Question

Adding an edge to a tree creates a cycle - is my proof correct?

score 4.9k · Answer 1 · 2026-04-12 18:39:15

4.9k

Views

Adding an edge to a tree creates a cycle - is my proof correct?

Published on 12 Apr 2026 - 18:39

score 80 · Answer 2 · 2026-04-17 01:51:15

80

Views

How to prove that a vertex is in a minimum weight subtree?

Published on 17 Apr 2026 - 1:51

score 834 · Answer 3 · 2026-05-10 15:09:35

834

Views

every planar graph can be expressed as a union of five edge-disjoint forests

Published on 10 May 2026 - 15:09

score 459 · Answer 4 · 2026-05-10 15:41:00

459

Views

Algorithm for the 2D Euclidean Minimum Spanning Tree

Published on 10 May 2026 - 15:41

score 986 · Answer 5 · 2026-04-16 15:40:37

986

Views

Number of labeled trees without a $(1,2)$ edge?

Published on 16 Apr 2026 - 15:40

score 40 · Answer 6 · 2026-04-15 11:51:42

40

Views

Let $T$ be a tree. $G$ is a new graph by adding vertix $x$ and connect it to one vertex through an edge in $T$.

Published on 15 Apr 2026 - 11:51

score 288 · Answer 7 · 2026-04-13 19:28:03

288

Views

Let a tree with a vertex of degree 4 .prove that there are at least four leaves in the tree

Published on 13 Apr 2026 - 19:28

score 394 · Answer 8 · 2026-05-10 15:09:09

394

Views

every planar graph can be expressed as a union of (maximum) five forests

Published on 10 May 2026 - 15:09

score 536 · Answer 9 · 2026-04-11 22:13:04

536

Views

How to prove that in a tree with $3$ leaves there's exactly one vertex of degree $3$?

Published on 11 Apr 2026 - 22:13

score 1.1k · Answer 10 · 2026-04-16 01:54:16

1.1k

Views

How many labeled trees are there if there're $4$ leaves that are set?

Published on 16 Apr 2026 - 1:54

score 88 · Answer 11 · 2026-04-15 17:23:40

88

Views

forest of a graph $G=(V,E)$

Published on 15 Apr 2026 - 17:23

score 100 · Answer 12 · 2026-04-13 00:08:35

100

Views

How to prove that the complement of a tree with $3$ leaves is not Euler graph?

Published on 13 Apr 2026 - 0:08

score 310 · Answer 13 · 2026-04-10 04:19:04

310

Views

Counting the labellings of paths in perfect binary trees

Published on 10 Apr 2026 - 4:19

score 693 · Answer 14 · 2026-05-10 13:49:09

693

Views

Total number of leaves binary tree with n internal nodes

Published on 10 May 2026 - 13:49

score 809 · Answer 15 · 2026-04-17 07:28:27

809

Views

let $G$ be a simple $n$-vertex graph with at least $2n−3$ edges. Prove that $G$ has two cycles of equal length.

Published on 17 Apr 2026 - 7:28

List Question

Adding an edge to a tree creates a cycle - is my proof correct?

How to prove that a vertex is in a minimum weight subtree?

every planar graph can be expressed as a union of five edge-disjoint forests

Algorithm for the 2D Euclidean Minimum Spanning Tree

Number of labeled trees without a $(1,2)$ edge?

Let $T$ be a tree. $G$ is a new graph by adding vertix $x$ and connect it to one vertex through an edge in $T$.

Let a tree with a vertex of degree 4 .prove that there are at least four leaves in the tree

every planar graph can be expressed as a union of (maximum) five forests

How to prove that in a tree with $3$ leaves there's exactly one vertex of degree $3$?

How many labeled trees are there if there're $4$ leaves that are set?

forest of a graph $G=(V,E)$

How to prove that the complement of a tree with $3$ leaves is not Euler graph?

Counting the labellings of paths in perfect binary trees

Total number of leaves binary tree with n internal nodes

let $G$ be a simple $n$-vertex graph with at least $2n−3$ edges. Prove that $G$ has two cycles of equal length.

Trending Questions

Popular # Hahtags

Popular Questions