Question

Need help with a weird Graph Theory Proof about "quasi-factorizable" graph

score 96 · Answer 1 · 2023-12-30 17:29:26

96

Views

Need help with a weird Graph Theory Proof about "quasi-factorizable" graph

Published on 30 Dec 2023 - 17:29

score 27 · Answer 2 · 2023-12-30 23:18:48

27

Views

Weighted colouring nodes in a graph, based on other already-coloured nodes

Published on 30 Dec 2023 - 23:18

score 33 · Answer 3 · 2024-01-20 17:35:09

33

Views

Understanding why every 3-connected graph that is not $K_4$ has an edge such that suppressing an end also gives a 3-connected graph

Published on 20 Jan 2024 - 17:35

score 45 · Answer 4 · 2024-01-21 22:09:44

45

Views

If the bridges of a $3$-regular graph $G$ lie on a single path then $G$ has a $1$-Factor (perfect matching)

Published on 21 Jan 2024 - 22:09

score 88 · Answer 5 · 2024-01-23 10:13:32

88

Views

Prove or disprove "one simple connected graph $G_n$ has no vertex of degree more than two if and only if it is $C_n$ or $C_n$ with one edge removed"

Published on 23 Jan 2024 - 10:13

score 49 · Answer 6 · 2024-02-08 16:01:35

49

Views

The relationship between cyclic connectivity and vertex-disjoint cycles.

Published on 08 Feb 2024 - 16:01

score 23 · Answer 7 · 2024-03-03 23:19:49

23

Views

Triangle is $2$-connected or $3$?

Published on 03 Mar 2024 - 23:19

score 23 · Answer 8 · 2024-03-04 10:10:16

23

Views

Special form of 3 vertex-connectedness for Graphs with every edge contained in a perfect matching

Published on 04 Mar 2024 - 10:10

score 24 · Answer 9 · 2024-03-17 13:13:21

24

Views

Simple graph connectivity when minimum degree is $\geq \frac{n-1} {2}$

Published on 17 Mar 2024 - 13:13

score 49 · Answer 10 · 2024-03-23 01:00:04

49

Views

Are all 2-connected graphs planar?

Published on 23 Mar 2024 - 1:00

score 1.5k · Answer 11 · 2015-04-08 14:11:09

1.5k

Views

Let G be a simple graph of order $n\geq 2$. If $|E(G)|>\binom{n-1}{2}$,then G is connected.

Published on 08 Apr 2015 - 14:11

score 4.2k · Answer 12 · 2015-09-18 17:02:18

4.2k

Views

Inequality relating connectivity, edge connectivity and minimum degree (Whitney's theorem)

Published on 18 Sep 2015 - 17:02

score 435 · Answer 13 · 2015-11-04 08:51:05

435

Views

Every 3-connected graph has a cycle C such that G-V(C) is connected

Published on 04 Nov 2015 - 8:51

score 33 · Answer 14 · 2016-03-24 21:58:04

33

Views

Vertex connectivity in circumscribed simple line arrangements

Published on 24 Mar 2016 - 21:58

score 395 · Answer 15 · 2016-05-02 19:11:54

395

Views

Prove that every - 2-connected graph with n vertices has at least n spanning trees

Published on 02 May 2016 - 19:11

List Question

Need help with a weird Graph Theory Proof about "quasi-factorizable" graph

Weighted colouring nodes in a graph, based on other already-coloured nodes

Understanding why every 3-connected graph that is not $K_4$ has an edge such that suppressing an end also gives a 3-connected graph

If the bridges of a $3$-regular graph $G$ lie on a single path then $G$ has a $1$-Factor (perfect matching)

Prove or disprove "one simple connected graph $G_n$ has no vertex of degree more than two if and only if it is $C_n$ or $C_n$ with one edge removed"

The relationship between cyclic connectivity and vertex-disjoint cycles.

Triangle is $2$-connected or $3$?

Special form of 3 vertex-connectedness for Graphs with every edge contained in a perfect matching

Simple graph connectivity when minimum degree is $\geq \frac{n-1} {2}$

Are all 2-connected graphs planar?

Let G be a simple graph of order $n\geq 2$. If $|E(G)|>\binom{n-1}{2}$,then G is connected.

Inequality relating connectivity, edge connectivity and minimum degree (Whitney's theorem)

Every 3-connected graph has a cycle C such that G-V(C) is connected

Vertex connectivity in circumscribed simple line arrangements

Prove that every - 2-connected graph with n vertices has at least n spanning trees

Trending Questions

Popular # Hahtags

Popular Questions