Question

Finding a maximum connected planar graph to prove the four colour theorem

score 435 · Answer 1 · 2026-02-23 02:54:33

435

Views

Finding a maximum connected planar graph to prove the four colour theorem

Published on 23 Feb 2026 - 2:54

score 210 · Answer 2 · 2017-10-29 21:06:57

210

Views

If $G$ is a graph of order $n \ge 5$ and size $m\ge 3n - 5$ then $G$ contains a subgraph with minimum degree 4.

Published on 29 Oct 2017 - 21:06

score 329 · Answer 3 · 2017-11-07 12:57:51

329

Views

Existence of non-adjacent pair of vertices of small degree in planar graph

Published on 07 Nov 2017 - 12:57

score 123 · Answer 4 · 2026-03-26 07:56:50

123

Views

Four-Colour Conjecture true with additional hypothesis

Published on 26 Mar 2026 - 7:56

score 1.3k · Answer 5 · 2017-11-17 22:15:12

1.3k

Views

What is a lobe in graph theory?

Published on 17 Nov 2017 - 22:15

score 558 · Answer 6 · 2017-11-20 04:24:56

558

Views

Sketch a 5 regular planar graph, G with $\chi(G)$ = 3.

Published on 20 Nov 2017 - 4:24

score 636 · Answer 7 · 2017-12-05 19:55:20

636

Views

Planarity of 4-dimensional hypercube graph with 2 adjacent vertices deleted

Published on 05 Dec 2017 - 19:55

score 136 · Answer 8 · 2017-12-06 08:45:40

136

Views

question about the empire map

Published on 06 Dec 2017 - 8:45

score 362 · Answer 9 · 2017-12-08 18:29:57

362

Views

Proving rigorously that a planar graph with at least two faces contains a cycle

Published on 08 Dec 2017 - 18:29

score 335 · Answer 10 · 2017-12-08 19:27:28

335

Views

A property of the "outerplanar" vertices of a plane graph

Published on 08 Dec 2017 - 19:27

score 183 · Answer 11 · 2017-12-09 13:11:47

183

Views

Rigorous proof that if $G$ is planar, connected and not a tree, then the boundary of every face contains a cycle

Published on 09 Dec 2017 - 13:11

score 567 · Answer 12 · 2017-12-16 01:08:29

567

Views

Number of vertices in a planar graph

Published on 16 Dec 2017 - 1:08

score 334 · Answer 13 · 2017-12-21 22:23:18

334

Views

An analogue of Reidemeister moves for plane graphs

Published on 21 Dec 2017 - 22:23

score 669 · Answer 14 · 2018-01-07 18:24:27

669

Views

Prove that for every even $n\ge 4 $, there exists a planar, connected and 3-regular graph with $n$ vertices

Published on 07 Jan 2018 - 18:24

score 6.9k · Answer 15 · 2011-07-15 11:52:10

6.9k

Views

What is a rigorous way to prove that this graph is non-planar?

Published on 15 Jul 2011 - 11:52

List Question

Finding a maximum connected planar graph to prove the four colour theorem

If $G$ is a graph of order $n \ge 5$ and size $m\ge 3n - 5$ then $G$ contains a subgraph with minimum degree 4.

Existence of non-adjacent pair of vertices of small degree in planar graph

Four-Colour Conjecture true with additional hypothesis

What is a lobe in graph theory?

Sketch a 5 regular planar graph, G with $\chi(G)$ = 3.

Planarity of 4-dimensional hypercube graph with 2 adjacent vertices deleted

question about the empire map

Proving rigorously that a planar graph with at least two faces contains a cycle

A property of the "outerplanar" vertices of a plane graph

Rigorous proof that if $G$ is planar, connected and not a tree, then the boundary of every face contains a cycle

Number of vertices in a planar graph

An analogue of Reidemeister moves for plane graphs

Prove that for every even $n\ge 4 $, there exists a planar, connected and 3-regular graph with $n$ vertices

What is a rigorous way to prove that this graph is non-planar?

Trending Questions

Popular # Hahtags

Popular Questions