Question

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

score 49 · Answer 1 · 2026-03-25 19:05:56

49

Views

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

Published on 25 Mar 2026 - 19:05

score 91 · Answer 2 · 2026-03-26 01:07:34

91

Views

elementary circuit in a strongly connected directed graph

Published on 26 Mar 2026 - 1:07

score 113 · Answer 3 · 2026-03-26 01:23:34

113

Views

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

Published on 26 Mar 2026 - 1:23

score 97 · Answer 4 · 2026-04-26 02:50:56

97

Views

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

Published on 26 Apr 2026 - 2:50

score 27 · Answer 5 · 2026-03-25 19:01:17

27

Views

squared matrix of a graph?

Published on 25 Mar 2026 - 19:01

score 238 · Answer 6 · 2026-03-25 19:00:28

238

Views

Shortest Path under 2 different weight functions

Published on 25 Mar 2026 - 19:00

score 108 · Answer 7 · 2026-03-25 22:09:57

108

Views

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

Published on 25 Mar 2026 - 22:09

score 1.1k · Answer 8 · 2026-03-25 19:06:08

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 25 Mar 2026 - 19:06

score 188 · Answer 9 · 2026-03-25 22:05:29

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 · 2026-03-25 20:36:24

1.1k

Views

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

Published on 25 Mar 2026 - 20:36

score 44 · Answer 11 · 2026-03-25 22:09:12

44

Views

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

Published on 25 Mar 2026 - 22:09

score 709 · Answer 12 · 2026-03-25 23:34:55

709

Views

Maximal spanning acyclic subgraph

Published on 25 Mar 2026 - 23:34

score 405 · Answer 13 · 2026-03-25 19:03:18

405

Views

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

Published on 25 Mar 2026 - 19:03

score 178 · Answer 14 · 2026-03-25 19:07:16

178

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 25 Mar 2026 - 19:07

score 61 · Answer 15 · 2026-05-10 19:01:45

61

Views

Help proving a theorem about node ordering of a directed multigraph

Published on 10 May 2026 - 19:01

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