Question

Does a (finite) planar graph with minimum degree 3 contain a neighbourhood consisting of bounded degree vertices?

score 72 · Answer 1 · 2020-09-12 05:25:53

72

Views

Does a (finite) planar graph with minimum degree 3 contain a neighbourhood consisting of bounded degree vertices?

Published on 12 Sep 2020 - 5:25

score 1.3k · Answer 2 · 2020-09-17 06:39:43

1.3k

Views

show that all trees are planar without using Euler's formula or the fact that all trees are planar

Published on 17 Sep 2020 - 6:39

score 185 · Answer 3 · 2020-09-20 20:52:19

185

Views

Coloring 4-connected triangulations with 4 odd vertices

Published on 20 Sep 2020 - 20:52

score 118 · Answer 4 · 2020-09-28 21:43:50

118

Views

How to know if a graph contains subdivisions of $K_{3,3}$ or $K_{5}$

Published on 28 Sep 2020 - 21:43

score 62 · Answer 5 · 2020-10-02 10:05:16

62

Views

Finding an area under the curve with no area

Published on 02 Oct 2020 - 10:05

score 29 · Answer 6 · 2020-10-03 06:09:47

29

Views

Determining unknown scalar using area relationship

Published on 03 Oct 2020 - 6:09

score 171 · Answer 7 · 2020-10-04 21:48:13

171

Views

Graphs: Recognizing a $P_4$ subgraph

Published on 04 Oct 2020 - 21:48

score 43 · Answer 8 · 2020-10-05 13:46:55

43

Views

Terminology for A line Pattern that Doesnt Cross

Published on 05 Oct 2020 - 13:46

score 513 · Answer 9 · 2020-10-06 22:56:36

513

Views

Number of edges in a planar graph where every face has five sides

Published on 06 Oct 2020 - 22:56

score 126 · Answer 10 · 2020-10-09 11:28:20

126

Views

Map colouring algorithm for rectangular regions

Published on 09 Oct 2020 - 11:28

score 41 · Answer 11 · 2020-10-09 23:40:32

41

Views

Euler's Relation for Planar Graphs

Published on 09 Oct 2020 - 23:40

score 397 · Answer 12 · 2020-10-10 14:16:32

397

Views

Existence of 3-regular connected bipartite planar graphs of order 14

Published on 10 Oct 2020 - 14:16

score 255 · Answer 13 · 2020-10-15 20:23:23

255

Views

Two from Cubic Subgraph Hardness

Published on 15 Oct 2020 - 20:23

score 237 · Answer 14 · 2020-10-15 22:22:50

237

Views

How to check if a graph is biplanar (thickness =2)?

Published on 15 Oct 2020 - 22:22

score 133 · Answer 15 · 2020-10-16 13:04:26

133

Views

Constructing a planar embedding from rigid vertices.

Published on 16 Oct 2020 - 13:04

List Question

Does a (finite) planar graph with minimum degree 3 contain a neighbourhood consisting of bounded degree vertices?

show that all trees are planar without using Euler's formula or the fact that all trees are planar

Coloring 4-connected triangulations with 4 odd vertices

How to know if a graph contains subdivisions of $K_{3,3}$ or $K_{5}$

Finding an area under the curve with no area

Determining unknown scalar using area relationship

Graphs: Recognizing a $P_4$ subgraph

Terminology for A line Pattern that Doesnt Cross

Number of edges in a planar graph where every face has five sides

Map colouring algorithm for rectangular regions

Euler's Relation for Planar Graphs

Existence of 3-regular connected bipartite planar graphs of order 14

Two from Cubic Subgraph Hardness

How to check if a graph is biplanar (thickness =2)?

Constructing a planar embedding from rigid vertices.

Trending Questions

Popular # Hahtags

Popular Questions