Question

Chess tournament [contest math]

score 67 · Answer 1 · 2026-03-26 20:37:57

67

Views

Chess tournament [contest math]

Published on 26 Mar 2026 - 20:37

score 59 · Answer 2 · 2026-03-26 19:01:58

59

Views

Determine the shortest distance travelled to pass through every path once and return to the starting position

Published on 26 Mar 2026 - 19:01

score 105 · Answer 3 · 2026-03-29 14:18:47

105

Views

Notation of a graph clustering operation

Published on 29 Mar 2026 - 14:18

score 155 · Answer 4 · 2026-03-25 20:35:02

155

Views

Weaker Version Of Hadwiger's Conjecture

Published on 25 Mar 2026 - 20:35

score 512 · Answer 5 · 2026-03-25 06:06:21

512

Views

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

Published on 25 Mar 2026 - 6:06

score 73 · Answer 6 · 2018-06-22 09:00:57

73

Views

Prove: the number of simple undirected graphs with n different nodes, s.t every node has even degree is $2^\binom{n-1}{2}$

Published on 22 Jun 2018 - 9:00

score 97 · Answer 7 · 2018-06-22 09:23:29

97

Views

An inequality of graph coloring

Published on 22 Jun 2018 - 9:23

score 1k · Answer 8 · 2026-03-28 03:00:40

1k

Views

Standard notation for the complete graph with self-loops?

Published on 28 Mar 2026 - 3:00

score 334 · Answer 9 · 2026-03-25 03:17:05

334

Views

Complement of 7-vertex planar graph

Published on 25 Mar 2026 - 3:17

score 492 · Answer 10 · 2026-03-30 22:16:34

492

Views

Interesting sequence involving prime numbers jumping on the number line.

Published on 30 Mar 2026 - 22:16

score 87 · Answer 11 · 2026-03-25 06:44:09

87

Views

Universal Classes of Regular Graphs

Published on 25 Mar 2026 - 6:44

score 61 · Answer 12 · 2018-06-22 19:16:42

61

Views

Diameter of graph on the plane

Published on 22 Jun 2018 - 19:16

score 499 · Answer 13 · 2026-03-25 06:12:08

499

Views

Proving vertex form of Menger's Theorem et al. without using capacity of vertices.

Published on 25 Mar 2026 - 6:12

score 232 · Answer 14 · 2026-03-25 03:01:16

232

Views

Determining (parity of) maximum path length from adjacency matrix. Can I avoid having to square?

Published on 25 Mar 2026 - 3:01

score 988 · Answer 15 · 2018-06-23 09:58:14

988

Views

Finding a longest path on a weighted graph - solvable deterministically and in polynomial time?

Published on 23 Jun 2018 - 9:58

List Question

Chess tournament [contest math]

Determine the shortest distance travelled to pass through every path once and return to the starting position

Notation of a graph clustering operation

Weaker Version Of Hadwiger's Conjecture

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

Prove: the number of simple undirected graphs with n different nodes, s.t every node has even degree is $2^\binom{n-1}{2}$

An inequality of graph coloring

Standard notation for the complete graph with self-loops?

Complement of 7-vertex planar graph

Interesting sequence involving prime numbers jumping on the number line.

Universal Classes of Regular Graphs

Diameter of graph on the plane

Proving vertex form of Menger's Theorem et al. without using capacity of vertices.

Determining (parity of) maximum path length from adjacency matrix. Can I avoid having to square?

Finding a longest path on a weighted graph - solvable deterministically and in polynomial time?

Trending Questions

Popular # Hahtags

Popular Questions