Question

Graph theory problem and connected components

score 71 · Answer 1 · 2018-12-24 06:57:27

71

Views

Graph theory problem and connected components

Published on 24 Dec 2018 - 6:57

score 267 · Answer 2 · 2018-12-28 20:55:26

267

Views

Equivalent characterization of Eulerian circuits

Published on 28 Dec 2018 - 20:55

score 1.8k · Answer 3 · 2019-01-09 04:37:32

1.8k

Views

A Graph G where each vertex has an even degree can be split into cycles by which no cycle has a common edge.

Published on 09 Jan 2019 - 4:37

score 1.6k · Answer 4 · 2026-03-25 04:35:45

1.6k

Views

Finding Euler path using powers of adjacency

Published on 25 Mar 2026 - 4:35

score 38 · Answer 5 · 2026-03-25 12:26:12

38

Views

Graph Problem: find X path lengths which are closest to each other (similar to shortest path)

Published on 25 Mar 2026 - 12:26

score 3k · Answer 6 · 2019-03-01 19:18:43

3k

Views

Eulerian Circuits. Prove that if every edge of a graph G lies on an odd number of cycles, G is Eulerian.

Published on 01 Mar 2019 - 19:18

score 25 · Answer 7 · 2026-03-25 12:24:50

25

Views

Path / Graph problem with X nodes looking for Y paths with the most similar length.

Published on 25 Mar 2026 - 12:24

score 780 · Answer 8 · 2019-03-08 17:17:29

780

Views

Only one graph of order 5 has the property that the addition of any edge produces an Eulerian graph. What is it?

Published on 08 Mar 2019 - 17:17

score 43 · Answer 9 · 2019-03-21 16:56:14

43

Views

Find Euler trail given a function that finds Euler Circuit.

Published on 21 Mar 2019 - 16:56

score 430 · Answer 10 · 2026-03-25 13:55:08

430

Views

Graph which is Bipartite, has an Euler circuit, but not a Hamiltonian circuit

Published on 25 Mar 2026 - 13:55

score 1.4k · Answer 11 · 2019-04-16 16:03:50

1.4k

Views

Find the number of degree 1 vertices in terms of n and d

Published on 16 Apr 2019 - 16:03

score 192 · Answer 12 · 2026-03-25 13:57:53

192

Views

Are Euler trails and tours of a graph the same as Hamilton paths and cycles of the corresponding "edge graph"?

Published on 25 Mar 2026 - 13:57

score 587 · Answer 13 · 2019-05-01 21:24:39

Give a counter example to show that if $G$ and $H$ are both Eulerian but only one is connected, then the cartesian product is not Eulerian

score 1.1k · Answer 14 · 2019-05-08 20:18:41

1.1k

Views

Does every Euler circuit pass through all vertices?

Published on 08 May 2019 - 20:18

score 71 · Answer 15 · 2019-05-11 06:27:19

71

Views

Upper bounds on the solution to a directed route inspection problem

Published on 11 May 2019 - 6:27

List Question

Graph theory problem and connected components

Equivalent characterization of Eulerian circuits

A Graph G where each vertex has an even degree can be split into cycles by which no cycle has a common edge.

Finding Euler path using powers of adjacency

Graph Problem: find X path lengths which are closest to each other (similar to shortest path)

Eulerian Circuits. Prove that if every edge of a graph G lies on an odd number of cycles, G is Eulerian.

Path / Graph problem with X nodes looking for Y paths with the most similar length.

Only one graph of order 5 has the property that the addition of any edge produces an Eulerian graph. What is it?

Find Euler trail given a function that finds Euler Circuit.

Graph which is Bipartite, has an Euler circuit, but not a Hamiltonian circuit

Find the number of degree 1 vertices in terms of n and d

Are Euler trails and tours of a graph the same as Hamilton paths and cycles of the corresponding "edge graph"?

Give a counter example to show that if $G$ and $H$ are both Eulerian but only one is connected, then the cartesian product is not Eulerian

Does every Euler circuit pass through all vertices?

Upper bounds on the solution to a directed route inspection problem

Trending Questions

Popular # Hahtags

Popular Questions