Question

Is it possible to calculate how many Topological sortings exist for any given Graph?

score 2.8k · Answer 1 · 2026-04-10 23:11:47

2.8k

Views

Is it possible to calculate how many Topological sortings exist for any given Graph?

Published on 10 Apr 2026 - 23:11

score 445 · Answer 2 · 2019-05-10 12:31:14

445

Views

Connection between max independent set and graph coloring

Published on 10 May 2019 - 12:31

score 76 · Answer 3 · 2019-05-10 13:02:02

76

Views

Prove: for a graph $G=(V,E)$, if$ |V| \ge 5$, there is a cycle in $G$ or in complement $G$

Published on 10 May 2019 - 13:02

score 536 · Answer 4 · 2026-03-25 12:49:17

536

Views

If $K_{14}$ is colored with two colors, there will be a monochromatic quadrangle.

Published on 25 Mar 2026 - 12:49

score 499 · Answer 5 · 2026-03-25 13:13:34

499

Views

Is this specific example of a graph having 10 vertices and 25 edges planar or non-planar?

Published on 25 Mar 2026 - 13:13

score 178 · Answer 6 · 2026-03-25 05:06:51

178

Views

Examples of models that generate networks with small world properties?

Published on 25 Mar 2026 - 5:06

score 199 · Answer 7 · 2019-05-10 17:01:30

199

Views

Why vertex and edge transitivity on a k-regular nonsymmetric graph implies even k

Published on 10 May 2019 - 17:01

score 1.2k · Answer 8 · 2026-04-11 00:07:41

1.2k

Views

Does every tree have a matrix representation?

Published on 11 Apr 2026 - 0:07

score 57 · Answer 9 · 2026-03-25 10:52:07

57

Views

Maximum variance partitioning graph into disjoints cliques

Published on 25 Mar 2026 - 10:52

score 218 · Answer 10 · 2026-03-25 03:21:30

218

Views

Does exponential of graph Laplacian preserve symmetry of polynomial?

Published on 25 Mar 2026 - 3:21

score 74 · Answer 11 · 2026-04-11 18:47:11

74

Views

Upper bounds on the solution to a directed route inspection problem

Published on 11 Apr 2026 - 18:47

score 52 · Answer 12 · 2019-05-11 10:29:29

In every weighted graph with every edges positive and more than $11$ vertices, there exist between every vertices at most $ 2n^{2} $ shortest paths

score 1.2k · Answer 13 · 2019-05-11 15:58:07

1.2k

Views

How many vertices of degree 2?

Published on 11 May 2019 - 15:58

score 338 · Answer 14 · 2019-05-11 16:56:50

338

Views

Minimal Number of Monochromatic Edges in a "under-colored" Kneser Graph

Published on 11 May 2019 - 16:56

score 34 · Answer 15 · 2026-04-09 22:12:25

34

Views

Determining the Distribution of Possible Prior States in a Boolean Network

Published on 09 Apr 2026 - 22:12

List Question

Is it possible to calculate how many Topological sortings exist for any given Graph?

Connection between max independent set and graph coloring

Prove: for a graph $G=(V,E)$, if$ |V| \ge 5$, there is a cycle in $G$ or in complement $G$

If $K_{14}$ is colored with two colors, there will be a monochromatic quadrangle.

Is this specific example of a graph having 10 vertices and 25 edges planar or non-planar?

Examples of models that generate networks with small world properties?

Why vertex and edge transitivity on a k-regular nonsymmetric graph implies even k

Does every tree have a matrix representation?

Maximum variance partitioning graph into disjoints cliques

Does exponential of graph Laplacian preserve symmetry of polynomial?

Upper bounds on the solution to a directed route inspection problem

In every weighted graph with every edges positive and more than $11$ vertices, there exist between every vertices at most $ 2n^{2} $ shortest paths

How many vertices of degree 2?

Minimal Number of Monochromatic Edges in a "under-colored" Kneser Graph

Determining the Distribution of Possible Prior States in a Boolean Network

Trending Questions

Popular # Hahtags

Popular Questions