Question

The Wikipedia definition of the degeneracy of a graph.

score 346 · Answer 1 · 2018-11-21 16:09:03

346

Views

The Wikipedia definition of the degeneracy of a graph.

Published on 21 Nov 2018 - 16:09

score 337 · Answer 2 · 2018-11-21 18:01:39

337

Views

Christmas gift giving

Published on 21 Nov 2018 - 18:01

score 157 · Answer 3 · 2018-11-21 19:42:57

157

Views

Connect a set of nodes with another set of the same size without intersections

Published on 21 Nov 2018 - 19:42

score 267 · Answer 4 · 2026-03-25 06:27:55

267

Views

An outerplanar G graph such that $G+k_1$ is not planar graph

Published on 25 Mar 2026 - 6:27

score 1.1k · Answer 5 · 2026-03-27 10:10:53

1.1k

Views

Determining the equivalence classes of an equivalence relation represented by graph via its adjacent matrix.

Published on 27 Mar 2026 - 10:10

score 198 · Answer 6 · 2026-03-25 07:44:49

198

Views

Confusion about the proof of Menger's Theorem in "Introduction to Graph Theory" by Douglas West

Published on 25 Mar 2026 - 7:44

score 35 · Answer 7 · 2018-11-22 12:59:20

35

Views

Which of the following is true in a tree: $E=O(V^2)$ or $E=O(V)$?

Published on 22 Nov 2018 - 12:59

score 310 · Answer 8 · 2018-11-22 17:58:18

310

Views

Find a closed walk in a graph that visits every vertex at least once.

Published on 22 Nov 2018 - 17:58

score 208 · Answer 9 · 2018-11-22 20:10:57

208

Views

Is the maximal irredundant set a dominating set?

Published on 22 Nov 2018 - 20:10

score 189 · Answer 10 · 2018-11-23 00:34:36

189

Views

Proof for BFS and DFS equivalence

Published on 23 Nov 2018 - 0:34

score 406 · Answer 11 · 2026-03-28 14:56:50

406

Views

Given an n by n matrix of 0s and 1s, find the maximum number of 1s you can remove if you can only remove 1s with another 1 in the same row or column

Published on 28 Mar 2026 - 14:56

score 115 · Answer 12 · 2026-03-25 06:04:39

115

Views

About $E_i$ in "An $n^{\frac{5}{2}}$ Algorithm for Maximum Matchings in Bipartite Graphs" by Hopcroft and Karp

Published on 25 Mar 2026 - 6:04

score 143 · Answer 13 · 2026-03-25 09:27:41

143

Views

Coloring triangles in a Delaunay triangulation on the surface of a 3d sphere.

Published on 25 Mar 2026 - 9:27

score 96 · Answer 14 · 2018-11-23 21:00:04

96

Views

Find the edge domination number of the graph of Fig. $1-14.$

Published on 23 Nov 2018 - 21:00

score 83 · Answer 15 · 2026-03-25 01:36:21

83

Views

True or False: Flow network with $n$ internal nodes has $2^n$ different cuts with all min capacity

Published on 25 Mar 2026 - 1:36

List Question

The Wikipedia definition of the degeneracy of a graph.

Christmas gift giving

Connect a set of nodes with another set of the same size without intersections

An outerplanar G graph such that $G+k_1$ is not planar graph

Determining the equivalence classes of an equivalence relation represented by graph via its adjacent matrix.

Confusion about the proof of Menger's Theorem in "Introduction to Graph Theory" by Douglas West

Which of the following is true in a tree: $E=O(V^2)$ or $E=O(V)$?

Find a closed walk in a graph that visits every vertex at least once.

Is the maximal irredundant set a dominating set?

Proof for BFS and DFS equivalence

Given an n by n matrix of 0s and 1s, find the maximum number of 1s you can remove if you can only remove 1s with another 1 in the same row or column

About $E_i$ in "An $n^{\frac{5}{2}}$ Algorithm for Maximum Matchings in Bipartite Graphs" by Hopcroft and Karp

Coloring triangles in a Delaunay triangulation on the surface of a 3d sphere.

Find the edge domination number of the graph of Fig. $1-14.$

True or False: Flow network with $n$ internal nodes has $2^n$ different cuts with all min capacity

Trending Questions

Popular # Hahtags

Popular Questions