Question

Enumerating “Cyclic Double Permutations”

score 209 · Answer 1 · 2023-05-16 21:34:14

209

Views

Enumerating “Cyclic Double Permutations”

Published on 16 May 2023 - 21:34

score 67 · Answer 2 · 2023-05-21 02:23:04

67

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 21 May 2023 - 2:23

score 100 · Answer 3 · 2023-05-26 14:41:12

100

Views

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

Published on 26 May 2023 - 14:41

score 49 · Answer 4 · 2023-06-24 17:35:01

49

Views

Is the following a Path?

Published on 24 Jun 2023 - 17:35

score 51 · Answer 5 · 2023-07-14 09:11:33

51

Views

Eulerian Graphs and Cycle Decompositions

Published on 14 Jul 2023 - 9:11

score 70 · Answer 6 · 2023-08-03 20:42:10

70

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 03 Aug 2023 - 20:42

score 38 · Answer 7 · 2023-08-05 18:20:22

38

Views

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

Published on 05 Aug 2023 - 18:20

score 65 · Answer 8 · 2023-08-12 09:51:07

65

Views

Confused about how to find de Bruijn sequence from Eulerian tour

Published on 12 Aug 2023 - 9:51

score 181 · Answer 9 · 2023-09-03 05:58:09

181

Views

Graph Theory - The Mouse problem

Published on 03 Sep 2023 - 5:58

score 157 · Answer 10 · 2023-10-07 08:55:01

157

Views

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

Published on 07 Oct 2023 - 8:55

score 107 · Answer 11 · 2023-10-10 23:08:17

107

Views

When is the partition refinement graph Eulerian?

Published on 10 Oct 2023 - 23:08

score 323 · Answer 12 · 2023-10-14 09:05:31

323

Views

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

Published on 14 Oct 2023 - 9:05

score 37 · Answer 13 · 2023-10-23 08:16:56

37

Views

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

Published on 23 Oct 2023 - 8:16

score 33 · Answer 14 · 2023-11-15 14:55:30

33

Views

How to find a vertex-induced subgraph with Eulerian cycle

Published on 15 Nov 2023 - 14:55

score 44 · Answer 15 · 2023-12-12 21:27:56

44

Views

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

Published on 12 Dec 2023 - 21:27

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