Question

Enumerating “Cyclic Double Permutations”

score 212 · Answer 1 · 2026-04-14 22:16:21

212

Views

Enumerating “Cyclic Double Permutations”

Published on 14 Apr 2026 - 22:16

score 70 · Answer 2 · 2026-04-17 03:45:26

70

Views

e <= 3v - 6 for planar graph question: why does every face (of a planar graph) have to have at least three sides?

Published on 17 Apr 2026 - 3:45

score 103 · Answer 3 · 2026-04-16 01:31:49

103

Views

Combinatorics graphs for $2k+1$ representatives from $k $ different countries.

Published on 16 Apr 2026 - 1:31

score 52 · Answer 4 · 2026-04-10 19:10:59

52

Views

Is the following a Path?

Published on 10 Apr 2026 - 19:10

score 54 · Answer 5 · 2026-04-16 05:13:50

54

Views

Eulerian Graphs and Cycle Decompositions

Published on 16 Apr 2026 - 5:13

score 73 · Answer 6 · 2026-04-15 11:31:31

73

Views

Prove by induction on the length of the walk that whenever it visits a vertex, it has traversed an odd number of edges incident to it

Published on 15 Apr 2026 - 11:31

score 41 · Answer 7 · 2026-04-15 04:15:35

41

Views

Are there at least $|V|$ Eulerian tours in $G$ if $G$ is even degree and connected? (My proof)

Published on 15 Apr 2026 - 4:15

score 68 · Answer 8 · 2026-04-11 06:55:17

68

Views

Confused about how to find de Bruijn sequence from Eulerian tour

Published on 11 Apr 2026 - 6:55

score 184 · Answer 9 · 2026-04-16 03:58:12

184

Views

Graph Theory - The Mouse problem

Published on 16 Apr 2026 - 3:58

score 160 · Answer 10 · 2026-04-11 19:24:11

160

Views

Why is a bipartite graph in which every vertex has degree exactly $2$ is simply a cycle?

Published on 11 Apr 2026 - 19:24

score 110 · Answer 11 · 2026-04-15 21:24:23

110

Views

When is the partition refinement graph Eulerian?

Published on 15 Apr 2026 - 21:24

score 325 · Answer 12 · 2026-04-16 05:37:16

325

Views

Prove that if a graph has an Eulerian path, then the number of odd degree vertices is either 0 or 2

Published on 16 Apr 2026 - 5:37

score 40 · Answer 13 · 2026-04-14 23:59:35

40

Views

Networks: Covering each edge and starting and ending at the same vertice when repeating edges must be involved.

Published on 14 Apr 2026 - 23:59

score 36 · Answer 14 · 2026-04-08 18:28:41

36

Views

How to find a vertex-induced subgraph with Eulerian cycle

Published on 08 Apr 2026 - 18:28

score 47 · Answer 15 · 2026-04-15 14:35:12

47

Views

Eulerian graph with $46$ vertices and $45$ edges

Published on 15 Apr 2026 - 14:35

List Question

Enumerating “Cyclic Double Permutations”

e <= 3v - 6 for planar graph question: why does every face (of a planar graph) have to have at least three sides?

Combinatorics graphs for $2k+1$ representatives from $k $ different countries.

Is the following a Path?

Eulerian Graphs and Cycle Decompositions

Prove by induction on the length of the walk that whenever it visits a vertex, it has traversed an odd number of edges incident to it

Are there at least $|V|$ Eulerian tours in $G$ if $G$ is even degree and connected? (My proof)

Confused about how to find de Bruijn sequence from Eulerian tour

Graph Theory - The Mouse problem

Why is a bipartite graph in which every vertex has degree exactly $2$ is simply a cycle?

When is the partition refinement graph Eulerian?

Prove that if a graph has an Eulerian path, then the number of odd degree vertices is either 0 or 2

Networks: Covering each edge and starting and ending at the same vertice when repeating edges must be involved.

How to find a vertex-induced subgraph with Eulerian cycle

Eulerian graph with $46$ vertices and $45$ edges

Trending Questions

Popular # Hahtags

Popular Questions