Question

A space curve is planar if and only if its torsion is everywhere 0

score 13k · Answer 1 · 2014-09-20 18:35:12

13k

Views

A space curve is planar if and only if its torsion is everywhere 0

Published on 20 Sep 2014 - 18:35

score 515 · Answer 2 · 2014-09-21 20:51:48

515

Views

Convex planar graphs

Published on 21 Sep 2014 - 20:51

score 130 · Answer 3 · 2026-03-25 20:35:35

130

Views

Is this the smallest graph with the desired properties?

Published on 25 Mar 2026 - 20:35

score 562 · Answer 4 · 2014-10-07 21:52:11

562

Views

Planar graphs and connectivity

Published on 07 Oct 2014 - 21:52

score 67 · Answer 5 · 2014-10-09 22:57:50

67

Views

Planarity Criterion

Published on 09 Oct 2014 - 22:57

score 38 · Answer 6 · 2014-10-17 16:01:29

38

Views

Does every polyhedral graph have a path cover with non-empty paths?

Published on 17 Oct 2014 - 16:01

score 46 · Answer 7 · 2014-10-23 18:09:46

46

Views

possible embeddings for a $2$-connected planar graph

Published on 23 Oct 2014 - 18:09

score 910 · Answer 8 · 2014-11-01 20:56:17

910

Views

If $G$ is bipartite and does not have $K_{3,3}$ as a topological minor, then $G$ is planar.

Published on 01 Nov 2014 - 20:56

score 59 · Answer 9 · 2014-11-01 21:47:09

59

Views

G with n vertices is planar if it has most an vertices

Published on 01 Nov 2014 - 21:47

score 55 · Answer 10 · 2014-11-11 13:46:30

55

Views

clarifiying a definition from graph theory more prcisely definition of A-Bridge

Published on 11 Nov 2014 - 13:46

score 102 · Answer 11 · 2014-11-16 20:57:28

102

Views

Adding a vertex $x$ adjacent to every vertex in a subdivision in$K_{2,3}$ or $K_4$ is a subdivision of $K_5$ or $K_{3,3}$.

Published on 16 Nov 2014 - 20:57

score 944 · Answer 12 · 2014-11-16 21:22:11

944

Views

Edge contraction and subdivision

Published on 16 Nov 2014 - 21:22

score 463 · Answer 13 · 2014-11-27 18:37:58

463

Views

Partitioning a planar graph into spanning trees?

Published on 27 Nov 2014 - 18:37

score 337 · Answer 14 · 2014-12-02 02:06:54

337

Views

Proving if planarity puzzle is planar

Published on 02 Dec 2014 - 2:06

score 92 · Answer 15 · 2014-12-03 08:43:01

92

Views

Planar graph with V ≥ 2 has at least 2 vertices whose degrees are at most 5

Published on 03 Dec 2014 - 8:43

List Question

A space curve is planar if and only if its torsion is everywhere 0

Convex planar graphs

Is this the smallest graph with the desired properties?

Planar graphs and connectivity

Planarity Criterion

Does every polyhedral graph have a path cover with non-empty paths?

possible embeddings for a $2$-connected planar graph

If $G$ is bipartite and does not have $K_{3,3}$ as a topological minor, then $G$ is planar.

G with n vertices is planar if it has most an vertices

clarifiying a definition from graph theory more prcisely definition of A-Bridge

Adding a vertex $x$ adjacent to every vertex in a subdivision in$K_{2,3}$ or $K_4$ is a subdivision of $K_5$ or $K_{3,3}$.

Edge contraction and subdivision

Partitioning a planar graph into spanning trees?

Proving if planarity puzzle is planar

Planar graph with V ≥ 2 has at least 2 vertices whose degrees are at most 5

Trending Questions

Popular # Hahtags

Popular Questions