Question

Importance of graph planarity for applications

score 773 · Answer 1 · 2017-02-10 21:51:12

773

Views

Importance of graph planarity for applications

Published on 10 Feb 2017 - 21:51

score 1k · Answer 2 · 2017-02-10 22:36:27

1k

Views

Prove that a maximal planar ("triangulated planar") graph has one of the three properties

Published on 10 Feb 2017 - 22:36

score 11.9k · Answer 3 · 2017-02-16 23:56:44

11.9k

Views

Is there a planar graph calculator?

Published on 16 Feb 2017 - 23:56

score 2.8k · Answer 4 · 2017-03-02 02:00:38

2.8k

Views

Proving that $G$ has a vertex of degree at most $3$ for planar graph.

Published on 02 Mar 2017 - 2:00

score 5.1k · Answer 5 · 2017-03-02 07:21:11

5.1k

Views

Prove that a bipartite planar graph has a vertex of degree at most 3

Published on 02 Mar 2017 - 7:21

score 1.1k · Answer 6 · 2017-03-08 12:45:18

1.1k

Views

Find amount of edges and vertices of a plane graph

Published on 08 Mar 2017 - 12:45

score 582 · Answer 7 · 2017-03-15 02:56:31

Show that there is no regular planar graph (all vertices degree 3) so that all regions, including the unbounded region, are hexagonal.

score 2.6k · Answer 8 · 2017-03-16 07:04:46

2.6k

Views

Graph Theory proving planarity

Published on 16 Mar 2017 - 7:04

score 4.4k · Answer 9 · 2017-03-17 00:07:13

Prove the following theorem: If $G$ is a planar graph with $p$ vertices, $q$ edges, and finite girth $g$, then $q \leq g( p−2)/(g-2) $.

score 235 · Answer 10 · 2017-03-22 12:29:36

235

Views

Example pairs of simple non-path graphs with planar Cartesian product

Published on 22 Mar 2017 - 12:29

score 1.7k · Answer 11 · 2017-03-27 23:38:22

1.7k

Views

Proof that every map produces a planar graph - Four Colour Theorem

Published on 27 Mar 2017 - 23:38

score 199 · Answer 12 · 2017-03-29 18:02:14

199

Views

How to characterize the planar graphs in which every simple cycle can bound a face

Published on 29 Mar 2017 - 18:02

score 176 · Answer 13 · 2026-03-25 14:27:07

176

Views

conditions of a maximal planar graph to be chordal

Published on 25 Mar 2026 - 14:27

score 149 · Answer 14 · 2026-03-25 14:26:49

149

Views

Number of Hamiltonian Cycles in planar chordal graph

Published on 25 Mar 2026 - 14:26

score 1.4k · Answer 15 · 2017-04-08 00:36:41

1.4k

Views

A loop-free connected planar (simple) graph has at least one node of degree no more than 5 (True/False).

Published on 08 Apr 2017 - 0:36

List Question

Importance of graph planarity for applications

Prove that a maximal planar ("triangulated planar") graph has one of the three properties

Is there a planar graph calculator?

Proving that $G$ has a vertex of degree at most $3$ for planar graph.

Prove that a bipartite planar graph has a vertex of degree at most 3

Find amount of edges and vertices of a plane graph

Show that there is no regular planar graph (all vertices degree 3) so that all regions, including the unbounded region, are hexagonal.

Graph Theory proving planarity

Prove the following theorem: If $G$ is a planar graph with $p$ vertices, $q$ edges, and finite girth $g$, then $q \leq g( p−2)/(g-2) $.

Example pairs of simple non-path graphs with planar Cartesian product

Proof that every map produces a planar graph - Four Colour Theorem

How to characterize the planar graphs in which every simple cycle can bound a face

conditions of a maximal planar graph to be chordal

Number of Hamiltonian Cycles in planar chordal graph

A loop-free connected planar (simple) graph has at least one node of degree no more than 5 (True/False).

Trending Questions

Popular # Hahtags

Popular Questions