Question

Let G be a k-critical graph, where $k≥3$. Show that $G$ has at least $k+2$ vertices?

score 702 · Answer 1 · 2018-04-12 02:57:26

702

Views

Let G be a k-critical graph, where $k≥3$. Show that $G$ has at least $k+2$ vertices?

Published on 12 Apr 2018 - 2:57

score 67 · Answer 2 · 2026-03-23 00:15:49

67

Views

a special problem about numbers assigned on polygons

Published on 23 Mar 2026 - 0:15

score 48 · Answer 3 · 2018-04-12 08:35:40

48

Views

Shrinkehande graph?

Published on 12 Apr 2018 - 8:35

score 795 · Answer 4 · 2026-03-25 06:19:55

795

Views

Expected size of giant component in ER graph

Published on 25 Mar 2026 - 6:19

score 420 · Answer 5 · 2018-04-12 18:47:26

420

Views

Graphs - Proof that when all vertices of G have degree <=2, then each component of G is a path or a cycle.

Published on 12 Apr 2018 - 18:47

score 304 · Answer 6 · 2026-03-23 03:03:02

304

Views

Does every infinite connected graph contain a ray?

Published on 23 Mar 2026 - 3:03

score 2.8k · Answer 7 · 2026-03-25 17:20:12

2.8k

Views

Number of spanning trees in a graph with a vertex of degree N

Published on 25 Mar 2026 - 17:20

score 2.5k · Answer 8 · 2026-03-25 06:11:23

2.5k

Views

Can a bipartite graph have only 3 vertices?

Published on 25 Mar 2026 - 6:11

score 291 · Answer 9 · 2026-03-26 16:56:43

291

Views

Suggestion of books of Topology and Graph Theory

Published on 26 Mar 2026 - 16:56

score 1k · Answer 10 · 2026-03-24 20:36:56

1k

Views

How to interpret modularity of a weighted graph?

Published on 24 Mar 2026 - 20:36

score 228 · Answer 11 · 2018-04-13 05:57:03

228

Views

Number of edges of a graph with singles and pairs is 62. How many vertices are there?

Published on 13 Apr 2018 - 5:57

score 242 · Answer 12 · 2018-04-13 14:22:08

242

Views

I am finding it difficult to understand this adjacency matrix property- graph theory

Published on 13 Apr 2018 - 14:22

score 73 · Answer 13 · 2026-03-25 19:25:13

73

Views

Graph Theory - Triangles

Published on 25 Mar 2026 - 19:25

score 2.1k · Answer 14 · 2026-03-23 00:33:02

2.1k

Views

2-connected graph that is not 3-connected

Published on 23 Mar 2026 - 0:33

score 2.4k · Answer 15 · 2018-04-14 05:27:35

2.4k

Views

Prove that $G$ has $k$ pairwise disjoint $S$,$T,$ Paths?

Published on 14 Apr 2018 - 5:27

List Question

Let G be a k-critical graph, where $k≥3$. Show that $G$ has at least $k+2$ vertices?

a special problem about numbers assigned on polygons

Shrinkehande graph?

Expected size of giant component in ER graph

Graphs - Proof that when all vertices of G have degree <=2, then each component of G is a path or a cycle.

Does every infinite connected graph contain a ray?

Number of spanning trees in a graph with a vertex of degree N

Can a bipartite graph have only 3 vertices?

Suggestion of books of Topology and Graph Theory

How to interpret modularity of a weighted graph?

Number of edges of a graph with singles and pairs is 62. How many vertices are there?

I am finding it difficult to understand this adjacency matrix property- graph theory

Graph Theory - Triangles

2-connected graph that is not 3-connected

Prove that $G$ has $k$ pairwise disjoint $S$,$T,$ Paths?

Trending Questions

Popular # Hahtags

Popular Questions