Question

A connected simple graph $G$ has $14$ vertices and $88$ edges. Prove $G$ is Hamiltonian, but not Eulerian.

score 1.1k · Answer 1 · 2026-02-28 07:12:42

1.1k

Views

A connected simple graph $G$ has $14$ vertices and $88$ edges. Prove $G$ is Hamiltonian, but not Eulerian.

Published on 28 Feb 2026 - 7:12

score 1.2k · Answer 2 · 2026-03-23 03:51:36

1.2k

Views

A connected simple graph G has 14 vertices and 88 edges. Prove G is not Eulerian.

Published on 23 Mar 2026 - 3:51

score 2.7k · Answer 3 · 2015-12-10 09:35:44

2.7k

Views

Does this graph have Hamiltonian path and/or Eulerian paths?

Published on 10 Dec 2015 - 9:35

score 2.2k · Answer 4 · 2015-12-10 11:50:32

2.2k

Views

Does this graph have Eulerian circuit paths?

Published on 10 Dec 2015 - 11:50

score 73 · Answer 5 · 2015-12-13 16:57:53

73

Views

Is there exist an Euler graph on 2014 vertices with 3007 edges?

Published on 13 Dec 2015 - 16:57

score 1k · Answer 6 · 2015-12-19 16:47:28

1k

Views

Graph theory, graph coloring, hamilton

Published on 19 Dec 2015 - 16:47

score 559 · Answer 7 · 2015-12-20 13:20:00

559

Views

Graph problem, euler circuit and planar

Published on 20 Dec 2015 - 13:20

score 131.3k · Answer 8 · 2015-12-31 14:55:22

131.3k

Views

Is it possible to draw this picture without lifting the pen?

Published on 31 Dec 2015 - 14:55

score 165 · Answer 9 · 2016-01-22 13:22:07

165

Views

Show that K and K' cannot both contain an Eulerian trail

Published on 22 Jan 2016 - 13:22

score 99 · Answer 10 · 2016-02-12 11:49:24

99

Views

A finite, undirected, connected and simple graph with Eulerian circuit has $3$ vertices with the same degree

Published on 12 Feb 2016 - 11:49

score 1.3k · Answer 11 · 2016-02-23 09:39:24

1.3k

Views

Paths of even and odd lengths between cube vertices

Published on 23 Feb 2016 - 9:39

score 896 · Answer 12 · 2016-02-29 09:41:11

896

Views

hamiltonian and eulerian tour?

Published on 29 Feb 2016 - 9:41

score 27.1k · Answer 13 · 2016-03-07 14:00:59

27.1k

Views

How many Hamiltonian circuits are there in a complete graph with n vertices?

Published on 07 Mar 2016 - 14:00

score 3.1k · Answer 14 · 2016-03-07 15:34:40

3.1k

Views

Graph and its complement that both contain Eulerian circuits

Published on 07 Mar 2016 - 15:34

score 1.7k · Answer 15 · 2016-03-09 08:29:30

1.7k

Views

Graph and its line Graph that both contain Eulerian circuits

Published on 09 Mar 2016 - 8:29

List Question

A connected simple graph $G$ has $14$ vertices and $88$ edges. Prove $G$ is Hamiltonian, but not Eulerian.

A connected simple graph G has 14 vertices and 88 edges. Prove G is not Eulerian.

Does this graph have Hamiltonian path and/or Eulerian paths?

Does this graph have Eulerian circuit paths?

Is there exist an Euler graph on 2014 vertices with 3007 edges?

Graph theory, graph coloring, hamilton

Graph problem, euler circuit and planar

Is it possible to draw this picture without lifting the pen?

Show that K and K' cannot both contain an Eulerian trail

A finite, undirected, connected and simple graph with Eulerian circuit has $3$ vertices with the same degree

Paths of even and odd lengths between cube vertices

hamiltonian and eulerian tour?

How many Hamiltonian circuits are there in a complete graph with n vertices?

Graph and its complement that both contain Eulerian circuits

Graph and its line Graph that both contain Eulerian circuits

Trending Questions

Popular # Hahtags

Popular Questions