Question

Every $k$-connected graph is $k$-edge connected.

score 2.3k · Answer 1 · 2017-11-19 03:25:27

2.3k

Views

Every $k$-connected graph is $k$-edge connected.

Published on 19 Nov 2017 - 3:25

score 276 · Answer 2 · 2017-11-24 12:08:25

276

Views

Given a graph $G$ on $n$ vertices, with $\delta(G) \ge \frac{n-1}{2}$, show that $G$ is connected

Published on 24 Nov 2017 - 12:08

score 952 · Answer 3 · 2017-11-25 16:52:33

Prove or disprove: If $P = x...y$ is a path in a $2$-connected graph $G$ then there is another $xy$-path $P'$, which is internally disjoint from $P$.

score 1k · Answer 4 · 2017-11-28 13:51:09

1k

Views

Proving a 2-connected graph contains cycles (is my proof correct?)

Published on 28 Nov 2017 - 13:51

score 1.7k · Answer 5 · 2017-11-29 23:58:56

1.7k

Views

What is vertex connectivity of triangle graph?

Published on 29 Nov 2017 - 23:58

score 929 · Answer 6 · 2017-12-02 13:07:42

929

Views

Edge notation and connectedness

Published on 02 Dec 2017 - 13:07

score 1.2k · Answer 7 · 2017-12-07 07:14:02

1.2k

Views

3- connectivity of G-e and G/e where e is an edge of a 3-connected graph G.

Published on 07 Dec 2017 - 7:14

score 279 · Answer 8 · 2017-12-08 17:14:54

279

Views

Alternating path from any vertex to any vertex

Published on 08 Dec 2017 - 17:14

score 1.1k · Answer 9 · 2017-12-20 16:16:50

1.1k

Views

Prove that every connected k-regular bipartite graph on at least 3 vertices is 2-connected for k at least 2

Published on 20 Dec 2017 - 16:16

score 592 · Answer 10 · 2011-03-21 13:18:27

592

Views

Checking the biconnectivity of a biconnected graph with a vertex removed

Published on 21 Mar 2011 - 13:18

score 5.5k · Answer 11 · 2011-04-21 01:49:40

5.5k

Views

Show that if $G$ is simple a graph with $n$ vertices and the number of edges $m>\binom{n-1}{2}$, then $G$ is connected.

Published on 21 Apr 2011 - 1:49

score 441 · Answer 12 · 2013-01-24 16:38:08

441

Views

Edge-connectivity of edge-transitive graphs

Published on 24 Jan 2013 - 16:38

score 539 · Answer 13 · 2020-08-03 13:20:50

539

Views

The ratio of number of edges to the sum of vertices and edges of a graph.

Published on 03 Aug 2020 - 13:20

score 906 · Answer 14 · 2020-08-08 10:58:28

906

Views

Can two strongly connected components be connected with a directed edge and still be strongly connected?

Published on 08 Aug 2020 - 10:58

score 202 · Answer 15 · 2020-08-22 18:30:14

202

Views

Prove there are k independent A-B paths between two disjoint sets

Published on 22 Aug 2020 - 18:30

List Question

Every $k$-connected graph is $k$-edge connected.

Given a graph $G$ on $n$ vertices, with $\delta(G) \ge \frac{n-1}{2}$, show that $G$ is connected

Prove or disprove: If $P = x...y$ is a path in a $2$-connected graph $G$ then there is another $xy$-path $P'$, which is internally disjoint from $P$.

Proving a 2-connected graph contains cycles (is my proof correct?)

What is vertex connectivity of triangle graph?

Edge notation and connectedness

3- connectivity of G-e and G/e where e is an edge of a 3-connected graph G.

Alternating path from any vertex to any vertex

Prove that every connected k-regular bipartite graph on at least 3 vertices is 2-connected for k at least 2

Checking the biconnectivity of a biconnected graph with a vertex removed

Show that if $G$ is simple a graph with $n$ vertices and the number of edges $m>\binom{n-1}{2}$, then $G$ is connected.

Edge-connectivity of edge-transitive graphs

The ratio of number of edges to the sum of vertices and edges of a graph.

Can two strongly connected components be connected with a directed edge and still be strongly connected?

Prove there are k independent A-B paths between two disjoint sets

Trending Questions

Popular # Hahtags

Popular Questions