Question

Grid graphs eliminating edges

score 420 · Answer 1 · 2021-03-31 23:35:49

420

Views

Grid graphs eliminating edges

Published on 31 Mar 2021 - 23:35

score 470 · Answer 2 · 2021-04-02 09:00:49

470

Views

Given a disconnected graph prove that the diameter of its complements is 1 or 2 in witch case is 2.

Published on 02 Apr 2021 - 9:00

score 126 · Answer 3 · 2021-04-02 18:37:02

126

Views

find chromatic number

Published on 02 Apr 2021 - 18:37

score 1.4k · Answer 4 · 2021-04-03 10:16:17

1.4k

Views

Connectivity of a graph in the Erdős–Rényi model

Published on 03 Apr 2021 - 10:16

score 253 · Answer 5 · 2021-04-05 15:57:20

253

Views

every vertices except two in 2-connected graph can be linearly ordered in a specific way

Published on 05 Apr 2021 - 15:57

score 145 · Answer 6 · 2021-04-06 14:42:27

145

Views

Graph is connected exactly when it cannot be represented as a union of its two subgraphs

Published on 06 Apr 2021 - 14:42

score 102 · Answer 7 · 2021-04-07 18:46:29

102

Views

Comparing $k-$tutte-connectivity and $k-$vertex connectivity

Published on 07 Apr 2021 - 18:46

score 1.3k · Answer 8 · 2021-04-07 19:46:52

1.3k

Views

Show that a graph that is connected but not complete has vertices u,v and w such that uv and vw are edges but not uw.

Published on 07 Apr 2021 - 19:46

score 43 · Answer 9 · 2021-04-09 15:46:19

43

Views

For unconnected graphs, does Menger's Theorem hold?

Published on 09 Apr 2021 - 15:46

score 171 · Answer 10 · 2021-04-13 10:11:22

171

Views

Is there is a simple way to tell if a graph is 3-connected

Published on 13 Apr 2021 - 10:11

score 338 · Answer 11 · 2021-04-15 00:14:09

338

Views

Max number of edges in a graph with n vertices without $P_3$

Published on 15 Apr 2021 - 0:14

score 74 · Answer 12 · 2021-04-23 11:18:19

74

Views

Discrete Math 2-connected graph proof question

Published on 23 Apr 2021 - 11:18

score 51 · Answer 13 · 2021-04-24 00:54:32

51

Views

How to prove that a graph containing more paths of length 2 than $\binom{n}{2}$ (where n= #vertices) must contain a cycle of length 4.

Published on 24 Apr 2021 - 0:54

score 290 · Answer 14 · 2021-04-25 08:45:16

290

Views

Eulerian formula proof by induction on edges question

Published on 25 Apr 2021 - 8:45

score 296 · Answer 15 · 2021-04-29 20:55:22

296

Views

Does any connected graph G have a spanning tree T with the same domination number?

Published on 29 Apr 2021 - 20:55

List Question

Grid graphs eliminating edges

Given a disconnected graph prove that the diameter of its complements is 1 or 2 in witch case is 2.

find chromatic number

Connectivity of a graph in the Erdős–Rényi model

every vertices except two in 2-connected graph can be linearly ordered in a specific way

Graph is connected exactly when it cannot be represented as a union of its two subgraphs

Comparing $k-$tutte-connectivity and $k-$vertex connectivity

Show that a graph that is connected but not complete has vertices u,v and w such that uv and vw are edges but not uw.

For unconnected graphs, does Menger's Theorem hold?

Is there is a simple way to tell if a graph is 3-connected

Max number of edges in a graph with n vertices without $P_3$

Discrete Math 2-connected graph proof question

How to prove that a graph containing more paths of length 2 than $\binom{n}{2}$ (where n= #vertices) must contain a cycle of length 4.

Eulerian formula proof by induction on edges question

Does any connected graph G have a spanning tree T with the same domination number?

Trending Questions

Popular # Hahtags

Popular Questions