Question

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

score 89 · Answer 1 · 2026-04-17 11:30:24

89

Views

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

Published on 17 Apr 2026 - 11:30

score 66 · Answer 2 · 2026-04-09 05:02:31

66

Views

How to approach the proof of this formula for triangulations.

Published on 09 Apr 2026 - 5:02

score 404 · Answer 3 · 2026-04-16 15:45:43

404

Views

Outerplanar Graphs with |V| = 2

Published on 16 Apr 2026 - 15:45

score 743 · Answer 4 · 2026-04-16 21:04:34

743

Views

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

Published on 16 Apr 2026 - 21:04

score 824 · Answer 5 · 2026-04-15 06:16:16

824

Views

Planar Eulerian graph

Published on 15 Apr 2026 - 6:16

score 144 · Answer 6 · 2026-05-05 02:05:18

144

Views

Graph planarity definability clarification in literature?

Published on 05 May 2026 - 2:05

score 181 · Answer 7 · 2026-04-15 00:02:37

181

Views

Number of faces in n intersecting lines

Published on 15 Apr 2026 - 0:02

score 93 · Answer 8 · 2026-04-11 08:21:38

93

Views

Where can I find a proof of the 4 color theorem

Published on 11 Apr 2026 - 8:21

score 317 · Answer 9 · 2026-04-12 03:48:54

317

Views

Converse of Euler's formula for polyhedra

Published on 12 Apr 2026 - 3:48

score 90 · Answer 10 · 2026-04-17 10:09:31

90

Views

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

Published on 17 Apr 2026 - 10:09

score 541 · Answer 11 · 2026-04-15 21:22:37

541

Views

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

Published on 15 Apr 2026 - 21:22

score 217 · Answer 12 · 2026-05-10 21:01:22

217

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 10 May 2026 - 21:01

score 218 · Answer 13 · 2026-05-10 19:22:14

218

Views

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

Published on 10 May 2026 - 19:22

score 242 · Answer 14 · 2026-05-10 15:03:07

242

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 10 May 2026 - 15:03

score 34 · Answer 15 · 2026-04-11 11:26:13

34

Views

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

Published on 11 Apr 2026 - 11:26

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