Question

How to find the largest connected component of an undirected graph using its incidence matrix?

score 4.8k · Answer 1 · 2026-04-13 19:48:27

4.8k

Views

How to find the largest connected component of an undirected graph using its incidence matrix?

Published on 13 Apr 2026 - 19:48

score 1.6k · Answer 2 · 2026-04-16 03:16:03

1.6k

Views

Number of self-avoiding rook walks in a rectangular grid

Published on 16 Apr 2026 - 3:16

score 252 · Answer 3 · 2026-04-09 21:33:25

252

Views

Probability of a balanced triangle in graph

Published on 09 Apr 2026 - 21:33

score 349 · Answer 4 · 2026-04-17 08:49:01

349

Views

All non-isomorphic graphs with chromatic number 4

Published on 17 Apr 2026 - 8:49

score 643 · Answer 5 · 2026-04-15 20:41:02

643

Views

Graph theory - inequality

Published on 15 Apr 2026 - 20:41

score 2.3k · Answer 6 · 2026-04-14 13:48:02

2.3k

Views

Cartesian product of two graphs

Published on 14 Apr 2026 - 13:48

score 226 · Answer 7 · 2026-04-16 01:10:28

226

Views

Find a maximum flow $f$ and a minimum cut $K$ in the network $N$

Published on 16 Apr 2026 - 1:10

score 935 · Answer 8 · 2026-04-13 17:54:34

935

Views

Determine whether the networks below are isomorphic

Published on 13 Apr 2026 - 17:54

score 188 · Answer 9 · 2026-04-14 23:10:52

188

Views

Partitioning graph edges into two cycleless sets

Published on 14 Apr 2026 - 23:10

score 52 · Answer 10 · 2026-04-11 13:42:57

52

Views

Clarification on notation

Published on 11 Apr 2026 - 13:42

score 1.7k · Answer 11 · 2026-04-15 18:48:17

1.7k

Views

A tree on n vertices where every vertex has degree 1 or 4. Prove that n ≡ 2 (mod 3)

Published on 15 Apr 2026 - 18:48

score 769 · Answer 12 · 2026-04-11 05:42:47

769

Views

Chromatic number proof verification

Published on 11 Apr 2026 - 5:42

score 105 · Answer 13 · 2026-04-15 14:37:14

105

Views

Adding a vertex $x$ adjacent to every vertex in a subdivision in$K_{2,3}$ or $K_4$ is a subdivision of $K_5$ or $K_{3,3}$.

Published on 15 Apr 2026 - 14:37

score 947 · Answer 14 · 2026-04-10 14:03:26

947

Views

Edge contraction and subdivision

Published on 10 Apr 2026 - 14:03

score 1.2k · Answer 15 · 2026-04-15 06:15:16

1.2k

Views

Fight against the Hydra - Graph Theory

Published on 15 Apr 2026 - 6:15

List Question

How to find the largest connected component of an undirected graph using its incidence matrix?

Number of self-avoiding rook walks in a rectangular grid

Probability of a balanced triangle in graph

All non-isomorphic graphs with chromatic number 4

Graph theory - inequality

Cartesian product of two graphs

Find a maximum flow $f$ and a minimum cut $K$ in the network $N$

Determine whether the networks below are isomorphic

Partitioning graph edges into two cycleless sets

Clarification on notation

A tree on n vertices where every vertex has degree 1 or 4. Prove that n ≡ 2 (mod 3)

Chromatic number proof verification

Adding a vertex $x$ adjacent to every vertex in a subdivision in$K_{2,3}$ or $K_4$ is a subdivision of $K_5$ or $K_{3,3}$.

Edge contraction and subdivision

Fight against the Hydra - Graph Theory

Trending Questions

Popular # Hahtags

Popular Questions