Question

Strong Relationship Between Abstract and Geometric Dual of a Finite Graph

score 182 · Answer 1 · 2026-03-11 18:18:04

182

Views

Strong Relationship Between Abstract and Geometric Dual of a Finite Graph

Published on 11 Mar 2026 - 18:18

score 22 · Answer 2 · 2021-09-16 15:47:40

22

Views

plabic graphs up to "homotopy" and how that relates to homeomorphisms that keep rotations around vertices intact.

Published on 16 Sep 2021 - 15:47

score 111 · Answer 3 · 2021-09-17 05:18:35

111

Views

Construct a quadrangulation with connectivity 2 and minimum degree 3

Published on 17 Sep 2021 - 5:18

score 291 · Answer 4 · 2021-09-21 16:49:59

291

Views

Requirements for embedding a graph in n-dimensional euclidean space

Published on 21 Sep 2021 - 16:49

score 40 · Answer 5 · 2021-09-24 11:33:22

How can I prove that every complement of $C_m$ (cyclic graph on $m$ vertices) is a supergraph of every complement of $C_n$. For $m>n$ (or equal)?

score 138 · Answer 6 · 2021-10-15 06:44:54

138

Views

How many different planar embeddings of a graph are possible?

Published on 15 Oct 2021 - 6:44

score 96 · Answer 7 · 2021-10-21 20:08:44

96

Views

Proof of Euler's graph theorem: $f=e-v+2$. Is it correct and how can it be improved?

Published on 21 Oct 2021 - 20:08

score 38 · Answer 8 · 2021-10-22 14:50:45

38

Views

Maximum degree for this set of planar graphs where all neighbours of any point lie on a circle centered on that point

Published on 22 Oct 2021 - 14:50

score 199 · Answer 9 · 2021-10-29 22:42:21

199

Views

Is $T_1+T_2$ planar if $T_1,T_2$ are trees with the same vertices?

Published on 29 Oct 2021 - 22:42

score 58 · Answer 10 · 2021-11-14 08:01:48

58

Views

How do I prove a graph is non planar?

Published on 14 Nov 2021 - 8:01

score 253 · Answer 11 · 2021-11-15 08:18:41

253

Views

Is the dual of a maximal plane graph with at least three vertices 2-edge-connected?

Published on 15 Nov 2021 - 8:18

score 129 · Answer 12 · 2026-03-29 03:36:39

129

Views

For any planar graph $G$ with a cut vertex, we can always add a straight edge in some plane drawing of $G$.

Published on 29 Mar 2026 - 3:36

score 34 · Answer 13 · 2021-11-17 16:07:44

34

Views

Expand acyclic graphs to acyclic graphs

Published on 17 Nov 2021 - 16:07

score 289 · Answer 14 · 2021-11-21 07:19:10

289

Views

Number of Vertices of a connect planer graph with 100 edges

Published on 21 Nov 2021 - 7:19

score 38 · Answer 15 · 2021-11-27 13:30:31

38

Views

Is "Traveling Salesman Problem" still NP-Complete if the shortest path length is provided

Published on 27 Nov 2021 - 13:30

List Question

Strong Relationship Between Abstract and Geometric Dual of a Finite Graph

plabic graphs up to "homotopy" and how that relates to homeomorphisms that keep rotations around vertices intact.

Construct a quadrangulation with connectivity 2 and minimum degree 3

Requirements for embedding a graph in n-dimensional euclidean space

How can I prove that every complement of $C_m$ (cyclic graph on $m$ vertices) is a supergraph of every complement of $C_n$. For $m>n$ (or equal)?

How many different planar embeddings of a graph are possible?

Proof of Euler's graph theorem: $f=e-v+2$. Is it correct and how can it be improved?

Maximum degree for this set of planar graphs where all neighbours of any point lie on a circle centered on that point

Is $T_1+T_2$ planar if $T_1,T_2$ are trees with the same vertices?

How do I prove a graph is non planar?

Is the dual of a maximal plane graph with at least three vertices 2-edge-connected?

For any planar graph $G$ with a cut vertex, we can always add a straight edge in some plane drawing of $G$.

Expand acyclic graphs to acyclic graphs

Number of Vertices of a connect planer graph with 100 edges

Is "Traveling Salesman Problem" still NP-Complete if the shortest path length is provided

Trending Questions

Popular # Hahtags

Popular Questions