Question

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

score 218 · Answer 1 · 2018-06-17 19:45:14

218

Views

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

Published on 17 Jun 2018 - 19:45

score 927 · Answer 2 · 2018-06-20 11:45:20

927

Views

Number of Hamiltonian cycles in incomplete graphs?

Published on 20 Jun 2018 - 11:45

score 511 · Answer 3 · 2018-06-22 03:55:24

511

Views

Proving that removing any two vertices from a 6-regular, graph of order 10 still results in a Hamiltonian graph

Published on 22 Jun 2018 - 3:55

score 47 · Answer 4 · 2018-07-16 03:50:33

47

Views

is it necessary for a graph to have Hamiltonian path if it has a Hamiltonian circuit?

Published on 16 Jul 2018 - 3:50

score 554 · Answer 5 · 2018-07-17 16:02:42

554

Views

Prove a DAG can be obtained by an undirected graph's longest cycle

Published on 17 Jul 2018 - 16:02

score 347 · Answer 6 · 2018-07-17 21:21:12

347

Views

Vocabulary of cycles in graph theory: closed walk, closed trek, closed trail and closed path

Published on 17 Jul 2018 - 21:21

score 39 · Answer 7 · 2018-08-07 08:32:10

39

Views

Are there any software or libraries(in some language) which draws all the planar graphs given the number of vertices?

Published on 07 Aug 2018 - 8:32

score 1.9k · Answer 8 · 2018-08-09 02:27:53

1.9k

Views

What is a spanning path in graph theory?

Published on 09 Aug 2018 - 2:27

score 925 · Answer 9 · 2018-08-10 17:03:27

925

Views

Random graphs with a hamiltonian path

Published on 10 Aug 2018 - 17:03

score 197 · Answer 10 · 2018-08-11 19:20:52

197

Views

Let $G = (V,E)$ be a tree, then $G$ is a caterpillar graph $\iff$ The line graph of $G$ contains a Hamiltonian path.

Published on 11 Aug 2018 - 19:20

score 283 · Answer 11 · 2018-08-30 14:28:19

283

Views

Are there more non-Hamiltonian graph than Hamiltonian on n vertices?

Published on 30 Aug 2018 - 14:28

score 1k · Answer 12 · 2018-08-31 09:27:12

1k

Views

Counting Hamiltonian cycles in a graph

Published on 31 Aug 2018 - 9:27

score 418 · Answer 13 · 2026-02-23 04:52:13

418

Views

Properly stating a decision problem for a Hamiltonian cycle problem

Published on 23 Feb 2026 - 4:52

score 612 · Answer 14 · 2026-03-25 01:21:49

612

Views

Spiral path on a Penrose tiling

Published on 25 Mar 2026 - 1:21

score 398 · Answer 15 · 2018-09-10 18:43:03

398

Views

How to generate a Penrose tessellation around a given tile?

Published on 10 Sep 2018 - 18:43

List Question

A graph has 29 vertices and 41 edges. What is the minimum number of distinct cycles that this graph could have?

Number of Hamiltonian cycles in incomplete graphs?

Proving that removing any two vertices from a 6-regular, graph of order 10 still results in a Hamiltonian graph

is it necessary for a graph to have Hamiltonian path if it has a Hamiltonian circuit?

Prove a DAG can be obtained by an undirected graph's longest cycle

Vocabulary of cycles in graph theory: closed walk, closed trek, closed trail and closed path

Are there any software or libraries(in some language) which draws all the planar graphs given the number of vertices?

What is a spanning path in graph theory?

Random graphs with a hamiltonian path

Let $G = (V,E)$ be a tree, then $G$ is a caterpillar graph $\iff$ The line graph of $G$ contains a Hamiltonian path.

Are there more non-Hamiltonian graph than Hamiltonian on n vertices?

Counting Hamiltonian cycles in a graph

Properly stating a decision problem for a Hamiltonian cycle problem

Spiral path on a Penrose tiling

How to generate a Penrose tessellation around a given tile?

Trending Questions

Popular # Hahtags

Popular Questions