Question

If $G$ cubic planar graph with faces only $C_5$ and $C_6$, then $G$ has $12$ pentagons and $0$ hexagons

score 86 · Answer 1 · 2019-06-09 15:28:33

86

Views

If $G$ cubic planar graph with faces only $C_5$ and $C_6$, then $G$ has $12$ pentagons and $0$ hexagons

Published on 09 Jun 2019 - 15:28

score 63 · Answer 2 · 2019-06-11 16:12:35

63

Views

How to approach the proof of this formula for triangulations.

Published on 11 Jun 2019 - 16:12

score 401 · Answer 3 · 2019-06-21 12:42:56

401

Views

Outerplanar Graphs with |V| = 2

Published on 21 Jun 2019 - 12:42

score 740 · Answer 4 · 2019-06-22 02:23:45

740

Views

Finding if a subgraph of a minimal non-planar graph is a maximal planar graph

Published on 22 Jun 2019 - 2:23

score 822 · Answer 5 · 2019-06-23 01:01:45

822

Views

Planar Eulerian graph

Published on 23 Jun 2019 - 1:01

score 136 · Answer 6 · 2026-03-22 22:38:33

136

Views

Graph planarity definability clarification in literature?

Published on 22 Mar 2026 - 22:38

score 178 · Answer 7 · 2019-06-27 20:42:15

178

Views

Number of faces in n intersecting lines

Published on 27 Jun 2019 - 20:42

score 90 · Answer 8 · 2019-06-27 21:08:41

90

Views

Where can I find a proof of the 4 color theorem

Published on 27 Jun 2019 - 21:08

score 314 · Answer 9 · 2019-06-30 11:58:08

314

Views

Converse of Euler's formula for polyhedra

Published on 30 Jun 2019 - 11:58

score 87 · Answer 10 · 2019-07-02 17:52:49

87

Views

Can every maximal planar graph be obtained as a minor of a planar graph with only even vertex degrees?

Published on 02 Jul 2019 - 17:52

score 538 · Answer 11 · 2019-07-04 00:57:41

538

Views

What're pairwise, vertex disjoint copies of $K_5$?

Published on 04 Jul 2019 - 0:57

score 216 · Answer 12 · 2026-03-25 12:51:03

216

Views

The drawn diagonals divide the $N\times N$ board into $K$ regions. For each $N$, determine the smallest and the largest possible values of $K$.

Published on 25 Mar 2026 - 12:51

score 208 · Answer 13 · 2026-03-22 11:09:07

208

Views

What is the fewest vertices a non-planar subgraph of the Knight's graph can have?

Published on 22 Mar 2026 - 11:09

score 240 · Answer 14 · 2026-03-22 23:53:19

240

Views

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

Published on 22 Mar 2026 - 23:53

score 31 · Answer 15 · 2019-07-17 10:39:24

31

Views

Need help to understand a particular portion of a paper by Laman.

Published on 17 Jul 2019 - 10:39

List Question

If $G$ cubic planar graph with faces only $C_5$ and $C_6$, then $G$ has $12$ pentagons and $0$ hexagons

How to approach the proof of this formula for triangulations.

Outerplanar Graphs with |V| = 2

Finding if a subgraph of a minimal non-planar graph is a maximal planar graph

Planar Eulerian graph

Graph planarity definability clarification in literature?

Number of faces in n intersecting lines

Where can I find a proof of the 4 color theorem

Converse of Euler's formula for polyhedra

Can every maximal planar graph be obtained as a minor of a planar graph with only even vertex degrees?

What're pairwise, vertex disjoint copies of $K_5$?

The drawn diagonals divide the $N\times N$ board into $K$ regions. For each $N$, determine the smallest and the largest possible values of $K$.

What is the fewest vertices a non-planar subgraph of the Knight's graph can have?

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

Need help to understand a particular portion of a paper by Laman.

Trending Questions

Popular # Hahtags

Popular Questions