Question

Graph theory find largest number of edges of graph

score 86 · Answer 1 · 2019-11-11 12:10:51

86

Views

Graph theory find largest number of edges of graph

Published on 11 Nov 2019 - 12:10

score 43 · Answer 2 · 2019-11-15 02:15:44

43

Views

Connected graph with where $G$ is planar but $\overline{G}$ isn't

Published on 15 Nov 2019 - 2:15

score 67 · Answer 3 · 2019-11-15 02:56:05

67

Views

Construct graph such that neither $G$ nor $\overline{G}$ is planar

Published on 15 Nov 2019 - 2:56

score 259 · Answer 4 · 2019-11-15 03:39:18

259

Views

Proving tripartite graph is always planar

Published on 15 Nov 2019 - 3:39

score 207 · Answer 5 · 2019-11-19 19:57:07

207

Views

crossing number and thickness of a simple graph $G$

Published on 19 Nov 2019 - 19:57

score 1.1k · Answer 6 · 2019-11-21 12:33:33

1.1k

Views

How many simple polygons can be made with n points?

Published on 21 Nov 2019 - 12:33

score 27 · Answer 7 · 2019-11-23 21:38:30

27

Views

Graph permutation and it's Euclidean interpretation

Published on 23 Nov 2019 - 21:38

score 145 · Answer 8 · 2019-11-26 19:26:49

145

Views

Graph conjecture. Is $|\sum(-2)^{F+C}|$, summed over spanning subgraphs, a power of two?

Published on 26 Nov 2019 - 19:26

score 178 · Answer 9 · 2019-11-26 23:01:10

178

Views

Straight-Line Planarity For Layered Family Trees

Published on 26 Nov 2019 - 23:01

score 830 · Answer 10 · 2019-11-29 09:21:09

830

Views

Why is Euler's Formula for Planar Graph Not Working Here?

Published on 29 Nov 2019 - 9:21

score 225 · Answer 11 · 2019-11-30 13:11:54

225

Views

Showing that graph build on octagon isn't planar

Published on 30 Nov 2019 - 13:11

score 778 · Answer 12 · 2019-12-01 00:49:17

778

Views

Number of edges in a planar graph where each face is incident to four edges.

Published on 01 Dec 2019 - 0:49

score 34 · Answer 13 · 2019-12-02 04:19:02

34

Views

Is there a planar graph $G+H$, where $G+H$ is the graph join, such that $G$ has 3 vertices and $H$ has 5 vertices?

Published on 02 Dec 2019 - 4:19

score 1.2k · Answer 14 · 2019-12-03 18:37:45

1.2k

Views

Prove that the icosahedron graph is the only maximal planar graph that is regular of degree $5$.

Published on 03 Dec 2019 - 18:37

score 24 · Answer 15 · 2019-12-08 01:50:01

24

Views

Is "Region Free Subgraph" an appropriate term for this type of subgraph?

Published on 08 Dec 2019 - 1:50

List Question

Graph theory find largest number of edges of graph

Connected graph with where $G$ is planar but $\overline{G}$ isn't

Construct graph such that neither $G$ nor $\overline{G}$ is planar

Proving tripartite graph is always planar

crossing number and thickness of a simple graph $G$

How many simple polygons can be made with n points?

Graph permutation and it's Euclidean interpretation

Graph conjecture. Is $|\sum(-2)^{F+C}|$, summed over spanning subgraphs, a power of two?

Straight-Line Planarity For Layered Family Trees

Why is Euler's Formula for Planar Graph Not Working Here?

Showing that graph build on octagon isn't planar

Number of edges in a planar graph where each face is incident to four edges.

Is there a planar graph $G+H$, where $G+H$ is the graph join, such that $G$ has 3 vertices and $H$ has 5 vertices?

Prove that the icosahedron graph is the only maximal planar graph that is regular of degree $5$.

Is "Region Free Subgraph" an appropriate term for this type of subgraph?

Trending Questions

Popular # Hahtags

Popular Questions