List questions from planar-graphs

Published on 19 Sep 2016 - 16:32

241

Views

Planar graph whose every face is a square

Published on 20 Sep 2016 - 0:53

124

Views

Proving a graph is planar - mutually tangent circles in a plane

Published on 22 Sep 2016 - 23:07

260

Views

Going with/against the orientation alternates along the Hamilton cycle?

Published on 23 Sep 2016 - 13:02

1.8k

Views

What is the largest number of regions formed by $6$ planes in space?

Published on 27 Sep 2016 - 22:08

811

Views

Embedding of a Graph in a Sphere

Published on 15 Oct 2016 - 6:50

1.3k

Views

How to prove this claim about bipartite graphs?

Published on 27 Oct 2016 - 0:44

21.6k

Views

Four color theorem disproof?

Published on 02 Nov 2016 - 6:22

546

Views

Bipartite Planar Graph

Published on 10 Nov 2016 - 1:32

1.6k

Views

A planar graph can be embedded in the plane in such a way that any vertex is on the exterior face

Published on 25 Mar 2026 - 4:41

1.5k

Views

Planar graph has an euler cycle iff its faces can be colored with 2 colors

Published on 26 Mar 2026 - 1:09

818

Views

$K_5$ minor implies $K_{3,3}$ subdivision, given 3-connected.

Published on 01 Dec 2016 - 4:47

9.3k

Views

4-regular planar graph is unique?

Published on 03 Dec 2016 - 4:07

867

Views

Why is homology unable to distinguish between planar and non-planar graphs?

Published on 23 Feb 2026 - 2:12

386

Views

If every node has degree three and the faces are three-colorable, then the graph bipartite.

Published on 04 Dec 2016 - 20:22

List Question

Questions of the form "let $G$ be a planar graph such that every face is a...$" Prove that...

Planar graph whose every face is a square

Proving a graph is planar - mutually tangent circles in a plane

Going with/against the orientation alternates along the Hamilton cycle?

What is the largest number of regions formed by $6$ planes in space?

Embedding of a Graph in a Sphere

How to prove this claim about bipartite graphs?

Four color theorem disproof?

Bipartite Planar Graph

A planar graph can be embedded in the plane in such a way that any vertex is on the exterior face

Planar graph has an euler cycle iff its faces can be colored with 2 colors

$K_5$ minor implies $K_{3,3}$ subdivision, given 3-connected.

4-regular planar graph is unique?

Why is homology unable to distinguish between planar and non-planar graphs?

If every node has degree three and the faces are three-colorable, then the graph bipartite.

Trending Questions

Popular # Hahtags

Popular Questions