Question

Which complete graphs have an Euler tour? Which of the complete graphs have an Euler trail?

score 591 · Answer 1 · 2020-11-09 23:43:27

591

Views

Which complete graphs have an Euler tour? Which of the complete graphs have an Euler trail?

Published on 09 Nov 2020 - 23:43

score 352 · Answer 2 · 2020-11-12 00:16:51

352

Views

3-regular graph and two-way Euler circuit

Published on 12 Nov 2020 - 0:16

score 89 · Answer 3 · 2020-11-18 23:27:40

89

Views

Does a eulerian cycle exist in this context?

Published on 18 Nov 2020 - 23:27

score 74 · Answer 4 · 2020-11-26 17:17:12

74

Views

Basic question about Euler trails

Published on 26 Nov 2020 - 17:17

score 315 · Answer 5 · 2020-12-01 05:11:57

315

Views

Euler circuits for the graph

Published on 01 Dec 2020 - 5:11

score 117 · Answer 6 · 2020-12-03 02:06:12

117

Views

Binary subsequence of size three, graph with euler cycle

Published on 03 Dec 2020 - 2:06

score 259 · Answer 7 · 2020-12-04 01:06:41

259

Views

Characterizing graphs for which the subdivision graph S(G) is Eulerian or Hamiltonian

Published on 04 Dec 2020 - 1:06

score 1.3k · Answer 8 · 2026-03-26 16:06:42

1.3k

Views

Determine if edge is a bridge in a graph

Published on 26 Mar 2026 - 16:06

score 81 · Answer 9 · 2021-02-01 16:09:27

81

Views

Relationship between the parity of the number of forests in a graph and Eulerianness

Published on 01 Feb 2021 - 16:09

score 93 · Answer 10 · 2021-02-06 19:04:36

93

Views

Simple connected eulerian graph $G = (V, E)$ cannot be bipartite if $(V, E - \{e_1,e_2,e_3\})$ is also eulerian

Published on 06 Feb 2021 - 19:04

score 1.2k · Answer 11 · 2021-02-10 03:29:31

1.2k

Views

How can one justify if the graph is planar from adjacency matrix?

Published on 10 Feb 2021 - 3:29

score 792 · Answer 12 · 2021-02-14 21:51:24

792

Views

Find the shortest route to visit at least once all edges of a undirected weighted non-Eulerian graph

Published on 14 Feb 2021 - 21:51

score 510 · Answer 13 · 2021-03-08 02:37:19

If $G$ is a connected graph, then $G$ contains an Euler circuit if and only if every vertex has even degree (Misunderstanding of terminology).

score 1.3k · Answer 14 · 2021-03-11 16:46:44

1.3k

Views

Drawing the grid without lifting the pen

Published on 11 Mar 2021 - 16:46

score 227 · Answer 15 · 2021-04-13 10:23:52

227

Views

Consecutive edges on Eulerian Circuit

Published on 13 Apr 2021 - 10:23

List Question

Which complete graphs have an Euler tour? Which of the complete graphs have an Euler trail?

3-regular graph and two-way Euler circuit

Does a eulerian cycle exist in this context?

Basic question about Euler trails

Euler circuits for the graph

Binary subsequence of size three, graph with euler cycle

Characterizing graphs for which the subdivision graph S(G) is Eulerian or Hamiltonian

Determine if edge is a bridge in a graph

Relationship between the parity of the number of forests in a graph and Eulerianness

Simple connected eulerian graph $G = (V, E)$ cannot be bipartite if $(V, E - \{e_1,e_2,e_3\})$ is also eulerian

How can one justify if the graph is planar from adjacency matrix?

Find the shortest route to visit at least once all edges of a undirected weighted non-Eulerian graph

If $G$ is a connected graph, then $G$ contains an Euler circuit if and only if every vertex has even degree (Misunderstanding of terminology).

Drawing the grid without lifting the pen

Consecutive edges on Eulerian Circuit

Trending Questions

Popular # Hahtags

Popular Questions