Question

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

score 4.9k · Answer 1 · 2018-05-16 13:56:51

4.9k

Views

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

Published on 16 May 2018 - 13:56

score 75 · Answer 2 · 2018-05-16 17:50:21

75

Views

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

Published on 16 May 2018 - 17:50

score 831 · Answer 3 · 2026-03-25 01:27:26

831

Views

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

Published on 25 Mar 2026 - 1:27

score 454 · Answer 4 · 2026-03-25 07:38:54

454

Views

Algorithm for the 2D Euclidean Minimum Spanning Tree

Published on 25 Mar 2026 - 7:38

score 983 · Answer 5 · 2018-05-18 00:21:16

983

Views

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

Published on 18 May 2018 - 0:21

score 37 · Answer 6 · 2018-05-19 09:52:33

37

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 19 May 2018 - 9:52

score 285 · Answer 7 · 2018-05-21 07:59:55

285

Views

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

Published on 21 May 2018 - 7:59

score 391 · Answer 8 · 2026-03-25 01:27:10

391

Views

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

Published on 25 Mar 2026 - 1:27

score 533 · Answer 9 · 2018-05-22 07:15:14

533

Views

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

Published on 22 May 2018 - 7:15

score 1k · Answer 10 · 2018-05-22 13:27:54

1k

Views

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

Published on 22 May 2018 - 13:27

score 85 · Answer 11 · 2018-05-23 01:37:57

85

Views

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

Published on 23 May 2018 - 1:37

score 97 · Answer 12 · 2018-05-23 09:37:01

97

Views

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

Published on 23 May 2018 - 9:37

score 307 · Answer 13 · 2018-05-25 16:00:17

307

Views

Counting the labellings of paths in perfect binary trees

Published on 25 May 2018 - 16:00

score 686 · Answer 14 · 2026-03-25 07:15:18

686

Views

Total number of leaves binary tree with n internal nodes

Published on 25 Mar 2026 - 7:15

score 806 · Answer 15 · 2018-06-01 14:44:38

806

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 01 Jun 2018 - 14:44

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