Question

Prove that a subgraph of a de Bruijn graph is still connected

score 48 · Answer 1 · 2020-01-04 12:08:20

48

Views

Prove that a subgraph of a de Bruijn graph is still connected

Published on 04 Jan 2020 - 12:08

score 90 · Answer 2 · 2020-01-05 07:33:22

90

Views

elementary circuit in a strongly connected directed graph

Published on 05 Jan 2020 - 7:33

score 112 · Answer 3 · 2020-01-05 11:57:21

112

Views

length of a path that passes through at least one vertex of each (elementary) circuit of a strong connected directed graph

Published on 05 Jan 2020 - 11:57

score 84 · Answer 4 · 2026-03-25 13:58:57

84

Views

Unlabeled (list-improper) coloring of all directed acyclic graphs with N nodes? ("Distinct Conversations")

Published on 25 Mar 2026 - 13:58

score 26 · Answer 5 · 2020-02-12 21:53:10

26

Views

squared matrix of a graph?

Published on 12 Feb 2020 - 21:53

score 237 · Answer 6 · 2020-03-03 16:56:57

237

Views

Shortest Path under 2 different weight functions

Published on 03 Mar 2020 - 16:56

score 107 · Answer 7 · 2020-03-10 17:57:43

107

Views

A question about s-t cuts in graph theory and their reverse.

Published on 10 Mar 2020 - 17:57

score 1.1k · Answer 8 · 2020-03-30 09:03:04

1.1k

Views

Every simple directed graph on $n$ vertices contains $2$ vertices with the same indegree or $2$ vertices with the same outdegree.

Published on 30 Mar 2020 - 9:03

score 187 · Answer 9 · 2020-04-03 04:56:52

Is there an approximate counting equation for paths in a directed acyclic graph with known average out degree and number of vertices?

score 1.1k · Answer 10 · 2020-04-05 01:45:44

1.1k

Views

If a tournament graph has no cycles of length $3$, prove that it is a partial order.

Published on 05 Apr 2020 - 1:45

score 43 · Answer 11 · 2020-04-05 21:21:45

43

Views

Reference Request: GI Completeness of Directed, Bipartite, Colored Graphs

Published on 05 Apr 2020 - 21:21

score 708 · Answer 12 · 2020-04-06 13:40:06

708

Views

Maximal spanning acyclic subgraph

Published on 06 Apr 2020 - 13:40

score 404 · Answer 13 · 2020-04-18 16:43:19

404

Views

How can I solve the Rotating Drum problem for 64 segments? (Or at all)

Published on 18 Apr 2020 - 16:43

score 177 · Answer 14 · 2020-04-19 04:56:40

177

Views

Let $D$ be a transitive tournament. Show that there is an order $v_1, v_2, ..., v_n$ of the vertices of $D$

Published on 19 Apr 2020 - 4:56

score 60 · Answer 15 · 2026-03-25 04:35:58

60

Views

Help proving a theorem about node ordering of a directed multigraph

Published on 25 Mar 2026 - 4:35

List Question

Prove that a subgraph of a de Bruijn graph is still connected

elementary circuit in a strongly connected directed graph

length of a path that passes through at least one vertex of each (elementary) circuit of a strong connected directed graph

Unlabeled (list-improper) coloring of all directed acyclic graphs with N nodes? ("Distinct Conversations")

squared matrix of a graph?

Shortest Path under 2 different weight functions

A question about s-t cuts in graph theory and their reverse.

Every simple directed graph on $n$ vertices contains $2$ vertices with the same indegree or $2$ vertices with the same outdegree.

Is there an approximate counting equation for paths in a directed acyclic graph with known average out degree and number of vertices?

If a tournament graph has no cycles of length $3$, prove that it is a partial order.

Reference Request: GI Completeness of Directed, Bipartite, Colored Graphs

Maximal spanning acyclic subgraph

How can I solve the Rotating Drum problem for 64 segments? (Or at all)

Let $D$ be a transitive tournament. Show that there is an order $v_1, v_2, ..., v_n$ of the vertices of $D$

Help proving a theorem about node ordering of a directed multigraph

Trending Questions

Popular # Hahtags

Popular Questions