List questions from graph-theory

Published on 16 Apr 2026 - 1:11

651

Views

Dividing tournament into "equal" groups

Published on 13 Apr 2026 - 18:55

271

Views

Find a neccessary and sufficient condition for $G$ to be Hamiltonian

Published on 14 Apr 2026 - 21:00

1.4k

Views

Prove that if $deg (v) > \frac{k}{2}$ for every $v \in V(G)$ then $G$ is Hamitonian.

Published on 14 Apr 2026 - 18:12

290

Views

Transition matrix to graph

Published on 14 Apr 2026 - 8:57

1.5k

Views

Calculating the "edge" distance between two points

Published on 13 Apr 2026 - 5:11

92

Views

Can books be arranged into bags?

Published on 09 Apr 2026 - 16:37

283

Views

Masters' thesis in algorithmic graph theory

Published on 15 Apr 2026 - 23:56

40

Views

Clarification on labelled graphs?

Published on 15 Apr 2026 - 14:59

582

Views

Show that if $G$ is a graph of order $n \geq 2$ for which $\kappa (G) \geq \alpha(G)-1$, then $G$ has a Hamiltonian path.

Published on 17 Apr 2026 - 0:41

65

Views

Show that if $H$ is a spanning subgraph of a non complete graph $G$ then $t(H) \leq t(G)$

Published on 14 Apr 2026 - 5:49

711

Views

The cycle space and cut space are orthogonal complement

Published on 16 Apr 2026 - 23:03

268

Views

Show that for each $n \geq 2$, $Q_n $ is Hamiltonian

Published on 17 Apr 2026 - 3:55

445

Views

Why does induction procedure of Euler characteristic fail for non-convex polyhedra? What am I missing?

Published on 11 Apr 2026 - 20:36

163

Views

spring representation of graphs

Published on 13 Apr 2026 - 18:03

List Question

A simple problem of graph theory.

Dividing tournament into "equal" groups

Find a neccessary and sufficient condition for $G$ to be Hamiltonian

Prove that if $deg (v) > \frac{k}{2}$ for every $v \in V(G)$ then $G$ is Hamitonian.

Transition matrix to graph

Calculating the "edge" distance between two points

Can books be arranged into bags?

Masters' thesis in algorithmic graph theory

Clarification on labelled graphs?

Show that if $G$ is a graph of order $n \geq 2$ for which $\kappa (G) \geq \alpha(G)-1$, then $G$ has a Hamiltonian path.

Show that if $H$ is a spanning subgraph of a non complete graph $G$ then $t(H) \leq t(G)$

The cycle space and cut space are orthogonal complement

Show that for each $n \geq 2$, $Q_n $ is Hamiltonian

Why does induction procedure of Euler characteristic fail for non-convex polyhedra? What am I missing?

spring representation of graphs

Trending Questions

Popular # Hahtags

Popular Questions