Question

How to prove that path in directed tree is directed path?

score 86 · Answer 1 · 2026-04-11 01:03:48

86

Views

How to prove that path in directed tree is directed path?

Published on 11 Apr 2026 - 1:03

score 231 · Answer 2 · 2026-04-16 11:01:37

231

Views

Is there a simple graph with an odd number of automorphisms (except $1$ and $3$)?

Published on 16 Apr 2026 - 11:01

score 206 · Answer 3 · 2026-04-12 18:22:52

206

Views

Definition of connected graph

Published on 12 Apr 2026 - 18:22

score 263 · Answer 4 · 2026-04-12 18:11:47

263

Views

Scheduling problem with two disjoint sets.

Published on 12 Apr 2026 - 18:11

score 93 · Answer 5 · 2026-04-11 20:32:19

93

Views

Is it possible to express the idea of a number bigger than any other number ($\infty$) in programming languanges?

Published on 11 Apr 2026 - 20:32

score 290 · Answer 6 · 2026-04-15 06:15:13

290

Views

Partitioning the plane into three sets each intersecting the vertices of every square with side 1?

Published on 15 Apr 2026 - 6:15

score 7.8k · Answer 7 · 2026-04-15 00:29:04

7.8k

Views

Why is a graph Laplacian matrix positive semidefinite?

Published on 15 Apr 2026 - 0:29

score 73 · Answer 8 · 2026-04-17 12:39:19

73

Views

Best score in this puzzle

Published on 17 Apr 2026 - 12:39

score 64 · Answer 9 · 2026-04-15 13:55:10

64

Views

Least graph containing every connected graph with $m$ nodes as an induced subgraph

Published on 15 Apr 2026 - 13:55

score 381 · Answer 10 · 2026-04-14 17:20:43

381

Views

Split a graph on order to solve min cut max flow algorithm in parallel

Published on 14 Apr 2026 - 17:20

score 45 · Answer 11 · 2026-04-16 09:47:38

45

Views

Expressing the order o f a planar graph with two properties.

Published on 16 Apr 2026 - 9:47

score 13.6k · Answer 12 · 2026-04-08 22:33:34

13.6k

Views

Can I use Dijkstra's Algorith for finding ALL shortest paths?

Published on 08 Apr 2026 - 22:33

score 96 · Answer 13 · 2026-04-16 22:53:36

96

Views

Show that if $G$ is a noncomplete graph of order $n$, then $t(G)≤\frac {n-α(G)}{α(G)}$

Published on 16 Apr 2026 - 22:53

score 59 · Answer 14 · 2026-04-16 15:01:55

59

Views

Show that for every non-negative rational number $r$, there exist a graph $G$ with $t(G)=r$

Published on 16 Apr 2026 - 15:01

score 1.4k · Answer 15 · 2026-04-15 20:24:43

1.4k

Views

Prove that no bipartite graph of order $3$ or more is Hamiltonian connected

Published on 15 Apr 2026 - 20:24

List Question

How to prove that path in directed tree is directed path?

Is there a simple graph with an odd number of automorphisms (except $1$ and $3$)?

Definition of connected graph

Scheduling problem with two disjoint sets.

Is it possible to express the idea of a number bigger than any other number ($\infty$) in programming languanges?

Partitioning the plane into three sets each intersecting the vertices of every square with side 1?

Why is a graph Laplacian matrix positive semidefinite?

Best score in this puzzle

Least graph containing every connected graph with $m$ nodes as an induced subgraph

Split a graph on order to solve min cut max flow algorithm in parallel

Expressing the order o f a planar graph with two properties.

Can I use Dijkstra's Algorith for finding ALL shortest paths?

Show that if $G$ is a noncomplete graph of order $n$, then $t(G)≤\frac {n-α(G)}{α(G)}$

Show that for every non-negative rational number $r$, there exist a graph $G$ with $t(G)=r$

Prove that no bipartite graph of order $3$ or more is Hamiltonian connected

Trending Questions

Popular # Hahtags

Popular Questions