Question

Let $v$ be a vertex of a 2-connected graph $G$. Prove that $v$ has a neighbor $u$ such that $G − u − v$ is connected.

score 1.4k · Answer 1 · 2018-06-08 08:04:32

1.4k

Views

Let $v$ be a vertex of a 2-connected graph $G$. Prove that $v$ has a neighbor $u$ such that $G − u − v$ is connected.

Published on 08 Jun 2018 - 8:04

score 498 · Answer 2 · 2018-06-22 19:50:21

498

Views

Proving vertex form of Menger's Theorem et al. without using capacity of vertices.

Published on 22 Jun 2018 - 19:50

score 1.8k · Answer 3 · 2018-06-27 18:00:22

1.8k

Views

strongly connected graph if and only if every edge belongs simple cycle

Published on 27 Jun 2018 - 18:00

score 591 · Answer 4 · 2018-07-01 14:45:18

591

Views

Complement of tree graph

Published on 01 Jul 2018 - 14:45

score 531 · Answer 5 · 2018-07-27 09:30:26

531

Views

3-connected multigraph and parallel edge

Published on 27 Jul 2018 - 9:30

score 130 · Answer 6 · 2018-07-31 22:44:32

130

Views

What connected graphs are with equal vertex-connectivity and minimum degree?

Published on 31 Jul 2018 - 22:44

score 207 · Answer 7 · 2026-03-16 12:54:36

207

Views

If every $H$-free $2$-connected graph is Hamiltonian then $H$ is $P_3$

Published on 16 Mar 2026 - 12:54

score 1.1k · Answer 8 · 2018-08-20 14:24:48

1.1k

Views

A measure of connectedness in graph theory

Published on 20 Aug 2018 - 14:24

score 29 · Answer 9 · 2026-03-25 03:02:16

29

Views

Show that a connected simple graph for which every edge is in some perfect matching is a block

Published on 25 Mar 2026 - 3:02

score 99 · Answer 10 · 2018-09-07 17:00:36

99

Views

GI-Completeness of graph isomorphism with connected graphs

Published on 07 Sep 2018 - 17:00

score 780 · Answer 11 · 2018-10-20 21:35:07

780

Views

Show that if G is a planar, simple and 3-connected graph, then the dual graph of G is simple and 3-connected

Published on 20 Oct 2018 - 21:35

score 535 · Answer 12 · 2018-10-24 04:39:09

535

Views

Question regarding connectivity number and maximum degree of a graph

Published on 24 Oct 2018 - 4:39

score 297 · Answer 13 · 2018-11-04 13:15:31

297

Views

How demonstre that a graph is connected?

Published on 04 Nov 2018 - 13:15

score 742 · Answer 14 · 2018-11-06 18:34:28

742

Views

Is there a word for "nodes that can reach every other node and itself again"?

Published on 06 Nov 2018 - 18:34

score 1k · Answer 15 · 2018-11-08 12:38:49

1k

Views

How many edges are needed to ensure k-connectivity?

Published on 08 Nov 2018 - 12:38

List Question

Let $v$ be a vertex of a 2-connected graph $G$. Prove that $v$ has a neighbor $u$ such that $G − u − v$ is connected.

Proving vertex form of Menger's Theorem et al. without using capacity of vertices.

strongly connected graph if and only if every edge belongs simple cycle

Complement of tree graph

3-connected multigraph and parallel edge

What connected graphs are with equal vertex-connectivity and minimum degree?

If every $H$-free $2$-connected graph is Hamiltonian then $H$ is $P_3$

A measure of connectedness in graph theory

Show that a connected simple graph for which every edge is in some perfect matching is a block

GI-Completeness of graph isomorphism with connected graphs

Show that if G is a planar, simple and 3-connected graph, then the dual graph of G is simple and 3-connected

Question regarding connectivity number and maximum degree of a graph

How demonstre that a graph is connected?

Is there a word for "nodes that can reach every other node and itself again"?

How many edges are needed to ensure k-connectivity?

Trending Questions

Popular # Hahtags

Popular Questions