Question

Connected/disconected graph vis-a-vis number of edges

score 47 · Answer 1 · 2026-04-15 16:42:11

47

Views

Connected/disconected graph vis-a-vis number of edges

Published on 15 Apr 2026 - 16:42

score 28 · Answer 2 · 2026-03-26 01:27:10

28

Views

Graph permutation and it's Euclidean interpretation

Published on 26 Mar 2026 - 1:27

score 109 · Answer 3 · 2026-05-10 14:38:16

109

Views

Eccentricity in infinite tournaments

Published on 10 May 2026 - 14:38

score 400 · Answer 4 · 2026-04-15 21:56:56

400

Views

Proof that for all simple bipartite graph G with n>=1 vertices, minDeg(G) + maxDeg(G) is less or equal than n

Published on 15 Apr 2026 - 21:56

score 264 · Answer 5 · 2026-03-26 04:34:03

264

Views

Probability of at least x Hamiltonian paths in a random tournament

Published on 26 Mar 2026 - 4:34

score 71 · Answer 6 · 2026-04-26 23:55:54

71

Views

Hamilton decompositions of cycle plus triangles graphs

Published on 26 Apr 2026 - 23:55

score 510 · Answer 7 · 2026-04-09 09:01:44

510

Views

Rolling Dodecahedron Path

Published on 09 Apr 2026 - 9:01

score 493 · Answer 8 · 2026-04-16 07:08:19

493

Views

Show that the elements of the cycle space of a graph G are precisely the unions of the edge sets of edge-disjoint cycles in G

Published on 16 Apr 2026 - 7:08

score 168 · Answer 9 · 2019-11-24 17:53:37

168

Views

If $G$ doesn't contain a $K_{3,3}$ or $K_{5}$ induced subgraph, then $G$ is planar

Published on 24 Nov 2019 - 17:53

score 276 · Answer 10 · 2019-11-24 18:39:12

276

Views

Proving three people must be mutually friends, enemies, or strangers

Published on 24 Nov 2019 - 18:39

score 2.5k · Answer 11 · 2026-04-14 03:48:06

2.5k

Views

Are there any conditions that are necessary for the existence of a Hamiltonian path in a graph?

Published on 14 Apr 2026 - 3:48

score 279 · Answer 12 · 2019-11-24 21:25:50

279

Views

Determining the chromatic polynomial of a graph

Published on 24 Nov 2019 - 21:25

score 871 · Answer 13 · 2026-04-14 02:54:59

How do I find the number of maximum possible number of connected components of a graph with given the number of vertices and edges.

score 704 · Answer 14 · 2026-04-16 07:00:06

704

Views

Structural Induction: Prove that all ternary trees with $n$ vertices have a height of at least $\lfloor\log_{3}{n}\rfloor$

Published on 16 Apr 2026 - 7:00

score 134 · Answer 15 · 2026-05-11 03:10:22

134

Views

How to maximize the number of edge under no circle in a directed graph?

Published on 11 May 2026 - 3:10

List Question

Connected/disconected graph vis-a-vis number of edges

Graph permutation and it's Euclidean interpretation

Eccentricity in infinite tournaments

Proof that for all simple bipartite graph G with n>=1 vertices, minDeg(G) + maxDeg(G) is less or equal than n

Probability of at least x Hamiltonian paths in a random tournament

Hamilton decompositions of cycle plus triangles graphs

Rolling Dodecahedron Path

Show that the elements of the cycle space of a graph G are precisely the unions of the edge sets of edge-disjoint cycles in G

If $G$ doesn't contain a $K_{3,3}$ or $K_{5}$ induced subgraph, then $G$ is planar

Proving three people must be mutually friends, enemies, or strangers

Are there any conditions that are necessary for the existence of a Hamiltonian path in a graph?

Determining the chromatic polynomial of a graph

How do I find the number of maximum possible number of connected components of a graph with given the number of vertices and edges.

Structural Induction: Prove that all ternary trees with $n$ vertices have a height of at least $\lfloor\log_{3}{n}\rfloor$

How to maximize the number of edge under no circle in a directed graph?

Trending Questions

Popular # Hahtags

Popular Questions