Question

How to Show a graph is 3-connected?

score 715 · Answer 1 · 2026-04-06 00:02:15

715

Views

How to Show a graph is 3-connected?

Published on 06 Apr 2026 - 0:02

score 357 · Answer 2 · 2026-03-25 09:25:36

357

Views

Can we have an infinite tree in this graph?

Published on 25 Mar 2026 - 9:25

score 50 · Answer 3 · 2026-04-05 22:03:33

50

Views

Characterization of Block Graphs

Published on 05 Apr 2026 - 22:03

score 328 · Answer 4 · 2026-03-25 09:29:53

328

Views

Show that the number of connected components are less or equal of the degree of vertex in a cut set.

Published on 25 Mar 2026 - 9:29

score 227 · Answer 5 · 2026-03-25 09:28:26

227

Views

Show that if $\kappa(G) \leq 1$ then $\lambda(G) \leq \frac{\Delta(G)}{2}$

Published on 25 Mar 2026 - 9:28

score 42 · Answer 6 · 2026-03-25 09:28:29

42

Views

Question regarding removal of a perfect matching in bridgeless graphs

Published on 25 Mar 2026 - 9:28

score 153 · Answer 7 · 2026-03-25 09:30:02

153

Views

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Published on 25 Mar 2026 - 9:30

score 242 · Answer 8 · 2026-03-25 09:23:52

242

Views

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Published on 25 Mar 2026 - 9:23

score 218 · Answer 9 · 2026-03-25 09:29:22

218

Views

Show that if $G$ is $k$-connected and $H$ is $t$-connected then $G+H$ is $(k+t)$-connected

Published on 25 Mar 2026 - 9:29

score 461 · Answer 10 · 2026-03-25 10:53:40

461

Views

A 2-connected graph contains a path passing through all the odd degree vertices

Published on 25 Mar 2026 - 10:53

score 403 · Answer 11 · 2026-03-25 09:26:26

403

Views

Prove that if a graph is k-connected, then it is also k-edge-connected

Published on 25 Mar 2026 - 9:26

score 2.8k · Answer 12 · 2026-03-25 09:30:03

2.8k

Views

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

Published on 25 Mar 2026 - 9:30

score 70 · Answer 13 · 2026-03-25 11:06:20

70

Views

Show that a bridge is incident on a maximum degree vertex

Published on 25 Mar 2026 - 11:06

score 557 · Answer 14 · 2026-03-25 09:27:17

557

Views

Algorithm to compute maximum independent set of graph with maximum block size k with comlexity $O(f(k)\cdot p(|V(G)|)$

Published on 25 Mar 2026 - 9:27

score 179 · Answer 15 · 2026-03-25 09:29:20

179

Views

Place bounds on the chromatic number of G given its maximum number of components

Published on 25 Mar 2026 - 9:29

List Question

How to Show a graph is 3-connected?

Can we have an infinite tree in this graph?

Characterization of Block Graphs

Show that the number of connected components are less or equal of the degree of vertex in a cut set.

Show that if $\kappa(G) \leq 1$ then $\lambda(G) \leq \frac{\Delta(G)}{2}$

Question regarding removal of a perfect matching in bridgeless graphs

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Show that if $G$ is $k$-connected and $H$ is $t$-connected then $G+H$ is $(k+t)$-connected

A 2-connected graph contains a path passing through all the odd degree vertices

Prove that if a graph is k-connected, then it is also k-edge-connected

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

Show that a bridge is incident on a maximum degree vertex

Algorithm to compute maximum independent set of graph with maximum block size k with comlexity $O(f(k)\cdot p(|V(G)|)$

Place bounds on the chromatic number of G given its maximum number of components

Trending Questions

Popular # Hahtags

Popular Questions