Question

Proof of existance of Eulerian cycle in directed graph

score 1.2k · Answer 1 · 2016-11-13 14:49:42

1.2k

Views

Proof of existance of Eulerian cycle in directed graph

Published on 13 Nov 2016 - 14:49

score 1.5k · Answer 2 · 2016-11-24 00:38:05

1.5k

Views

Planar graph has an euler cycle iff its faces can be colored with 2 colors

Published on 24 Nov 2016 - 0:38

score 281 · Answer 3 · 2016-11-24 21:43:25

281

Views

Do the even cycles of a graph form a subspace of the cycle space?

Published on 24 Nov 2016 - 21:43

score 2k · Answer 4 · 2016-11-27 18:15:57

2k

Views

For which n is K$_n$ Eulerian?

Published on 27 Nov 2016 - 18:15

score 1.5k · Answer 5 · 2016-11-29 04:08:14

1.5k

Views

Add a vertex to G so that the new graph is Eulerian

Published on 29 Nov 2016 - 4:08

score 5.6k · Answer 6 · 2016-12-13 20:24:32

5.6k

Views

How many different Eulerian circuits are there in this graph?

Published on 13 Dec 2016 - 20:24

score 352 · Answer 7 · 2017-01-08 13:49:05

352

Views

Eulerian Path In Directed Graph using SCC

Published on 08 Jan 2017 - 13:49

score 3.3k · Answer 8 · 2017-01-22 23:42:45

3.3k

Views

Graph $G$ has k vertices of odd degree, prove there is $\dfrac{k}{2}$ non-closed trails that cover all the edges of the graph exactly once.

Published on 22 Jan 2017 - 23:42

score 2k · Answer 9 · 2017-01-23 05:25:32

If $G$ is an Eulerian graph with edges $a$, $b$ sharing a vertex $v$, is it true that $G$ has an Eulerian trail in which $a$, $b$ are consecutive?

score 793 · Answer 10 · 2017-02-10 05:32:11

793

Views

Number of spanning arborescences does not depend on $i$.

Published on 10 Feb 2017 - 5:32

score 35 · Answer 11 · 2017-02-10 12:15:40

35

Views

Graph Theory - Does a graph have an eulerian circuit if its edges can be divided into groups, each having a hamiltonian circuit?

Published on 10 Feb 2017 - 12:15

score 1.2k · Answer 12 · 2017-02-13 15:15:12

1.2k

Views

Count how many unique eulerian path are in a graph?

Published on 13 Feb 2017 - 15:15

score 350 · Answer 13 · 2017-02-21 00:10:05

350

Views

How to notice bridges easily in Fleury's algorithm

Published on 21 Feb 2017 - 0:10

score 4.8k · Answer 14 · 2017-03-05 22:10:36

4.8k

Views

Does this graph with one vertex have an Euler circuit?

Published on 05 Mar 2017 - 22:10

score 524 · Answer 15 · 2017-03-06 22:06:05

524

Views

Complete Bipartite Graph, Euler and Hamiltonian Circuit

Published on 06 Mar 2017 - 22:06

List Question

Proof of existance of Eulerian cycle in directed graph

Planar graph has an euler cycle iff its faces can be colored with 2 colors

Do the even cycles of a graph form a subspace of the cycle space?

For which n is K$_n$ Eulerian?

Add a vertex to G so that the new graph is Eulerian

How many different Eulerian circuits are there in this graph?

Eulerian Path In Directed Graph using SCC

Graph $G$ has k vertices of odd degree, prove there is $\dfrac{k}{2}$ non-closed trails that cover all the edges of the graph exactly once.

If $G$ is an Eulerian graph with edges $a$, $b$ sharing a vertex $v$, is it true that $G$ has an Eulerian trail in which $a$, $b$ are consecutive?

Number of spanning arborescences does not depend on $i$.

Graph Theory - Does a graph have an eulerian circuit if its edges can be divided into groups, each having a hamiltonian circuit?

Count how many unique eulerian path are in a graph?

How to notice bridges easily in Fleury's algorithm

Does this graph with one vertex have an Euler circuit?

Complete Bipartite Graph, Euler and Hamiltonian Circuit

Trending Questions

Popular # Hahtags

Popular Questions