Question

Let $G$ be a simple graph with at least $11$ vertices. Prove that either $G$ or its complement $\overline{G}$ must be nonplanar. Connectivity?

score 1.8k · Answer 1 · 2014-02-11 05:41:21

1.8k

Views

Let $G$ be a simple graph with at least $11$ vertices. Prove that either $G$ or its complement $\overline{G}$ must be nonplanar. Connectivity?

Published on 11 Feb 2014 - 5:41

score 1.7k · Answer 2 · 2014-02-14 13:06:27

1.7k

Views

What is the maximum number of triangles in a planar graph with n vertices?

Published on 14 Feb 2014 - 13:06

score 3.6k · Answer 3 · 2014-02-15 14:30:08

3.6k

Views

can someone tell me if this graph contains subdivisions of both K5 and K3,3

Published on 15 Feb 2014 - 14:30

score 1.5k · Answer 4 · 2014-03-04 10:52:20

1.5k

Views

Mathematicly Untangeling Untangle.

Published on 04 Mar 2014 - 10:52

score 404 · Answer 5 · 2014-03-06 09:04:17

404

Views

Question on Planar Graph

Published on 06 Mar 2014 - 9:04

score 3.5k · Answer 6 · 2017-04-14 01:33:05

3.5k

Views

Show that for a planar graph with order $n \geq 3$ and size m with no triangles satisfies $m \leq 2n-4$

Published on 14 Apr 2017 - 1:33

score 1.7k · Answer 7 · 2017-04-17 16:39:04

1.7k

Views

crossing number of complete graph

Published on 17 Apr 2017 - 16:39

score 508 · Answer 8 · 2017-04-18 18:33:30

508

Views

Can someone please clarify this proof of the five-color theorem?

Published on 18 Apr 2017 - 18:33

score 951 · Answer 9 · 2017-04-19 22:15:13

951

Views

A characterisation of planar complete $k$-partite graphs

Published on 19 Apr 2017 - 22:15

score 754 · Answer 10 · 2017-04-26 04:04:58

754

Views

Relationship between the number of edges in the dual of graph with the degree of the original graph?

Published on 26 Apr 2017 - 4:04

score 597 · Answer 11 · 2017-05-02 00:17:51

597

Views

Prove that $G$ or $\bar G$ must be nonplanar if G has 11 vertices.

Published on 02 May 2017 - 0:17

score 408 · Answer 12 · 2017-05-07 22:09:03

408

Views

Graph planarity testing using Wagner's Theorem

Published on 07 May 2017 - 22:09

score 31 · Answer 13 · 2017-05-10 02:35:32

31

Views

Graph theory planar involving graphs

Published on 10 May 2017 - 2:35

score 149 · Answer 14 · 2017-05-10 21:22:42

149

Views

Coloring Dual of Euler Planar Graphs

Published on 10 May 2017 - 21:22

score 553 · Answer 15 · 2026-03-27 13:46:58

553

Views

Edge-disjoint Hamiltonian cycles in a planar graph.

Published on 27 Mar 2026 - 13:46

List Question

Let $G$ be a simple graph with at least $11$ vertices. Prove that either $G$ or its complement $\overline{G}$ must be nonplanar. Connectivity?

What is the maximum number of triangles in a planar graph with n vertices?

can someone tell me if this graph contains subdivisions of both K5 and K3,3

Mathematicly Untangeling Untangle.

Question on Planar Graph

Show that for a planar graph with order $n \geq 3$ and size m with no triangles satisfies $m \leq 2n-4$

crossing number of complete graph

Can someone please clarify this proof of the five-color theorem?

A characterisation of planar complete $k$-partite graphs

Relationship between the number of edges in the dual of graph with the degree of the original graph?

Prove that $G$ or $\bar G$ must be nonplanar if G has 11 vertices.

Graph planarity testing using Wagner's Theorem

Graph theory planar involving graphs

Coloring Dual of Euler Planar Graphs

Edge-disjoint Hamiltonian cycles in a planar graph.

Trending Questions

Popular # Hahtags

Popular Questions