Question

Disprove: "If a graph $G$ does not have a $K_{3,3}$ or a $K_5$ as an induced subgraph, then it is planar"

score 174 · Answer 1 · 2018-11-26 22:17:47

174

Views

Disprove: "If a graph $G$ does not have a $K_{3,3}$ or a $K_5$ as an induced subgraph, then it is planar"

Published on 26 Nov 2018 - 22:17

score 1.8k · Answer 2 · 2018-11-29 12:51:11

1.8k

Views

Is L(K4) graph planar?

Published on 29 Nov 2018 - 12:51

score 825 · Answer 3 · 2018-11-29 16:24:58

825

Views

How many region does a planar simple graph made of triangle splits the plane into?

Published on 29 Nov 2018 - 16:24

score 692 · Answer 4 · 2018-12-02 17:17:15

692

Views

Related to girth of planar graphs

Published on 02 Dec 2018 - 17:17

score 195 · Answer 5 · 2018-12-05 07:28:40

195

Views

Show that $K_n$ is not the union of two planar graphs

Published on 05 Dec 2018 - 7:28

score 2.2k · Answer 6 · 2018-12-06 13:16:24

2.2k

Views

Why can the complete graph K5 be embedded on a torus?

Published on 06 Dec 2018 - 13:16

score 518 · Answer 7 · 2018-12-10 00:33:40

518

Views

Is there a non-planar, non-hamiltonian and eulerian graph?

Published on 10 Dec 2018 - 0:33

score 1.9k · Answer 8 · 2018-12-13 19:51:13

1.9k

Views

Finding a subdivision of $K_4$ in a graph with minimum degree $3$.

Published on 13 Dec 2018 - 19:51

score 250 · Answer 9 · 2018-12-14 03:32:06

Prove that the thickness of $K_6$ is $2$. (That is, find two graphs $G$ and $H$ such that $G∪H = K_6$ and $G$ and $H$ are both planar.)

score 157 · Answer 10 · 2018-12-19 10:08:02

157

Views

Planar Graph Embedding with fixed vertex positions

Published on 19 Dec 2018 - 10:08

score 551 · Answer 11 · 2018-12-20 00:21:59

551

Views

Number of simple paths in undirected planar graph

Published on 20 Dec 2018 - 0:21

score 320 · Answer 12 · 2018-12-22 03:40:19

320

Views

Adding an edge to a maximal planar graph results in topological minors of both $K_5,K_{3,3}$.

Published on 22 Dec 2018 - 3:40

score 1.9k · Answer 13 · 2018-12-24 20:04:29

1.9k

Views

All 4-connected planar graphs are Hamiltonian-connected

Published on 24 Dec 2018 - 20:04

score 2.3k · Answer 14 · 2018-12-25 12:28:13

2.3k

Views

Minimum number of colors needed to color the graph

Published on 25 Dec 2018 - 12:28

score 369 · Answer 15 · 2018-12-31 00:02:00

369

Views

Self-complementary graph exercise

Published on 31 Dec 2018 - 0:02

List Question

Disprove: "If a graph $G$ does not have a $K_{3,3}$ or a $K_5$ as an induced subgraph, then it is planar"

Is L(K4) graph planar?

How many region does a planar simple graph made of triangle splits the plane into?

Related to girth of planar graphs

Show that $K_n$ is not the union of two planar graphs

Why can the complete graph K5 be embedded on a torus?

Is there a non-planar, non-hamiltonian and eulerian graph?

Finding a subdivision of $K_4$ in a graph with minimum degree $3$.

Prove that the thickness of $K_6$ is $2$. (That is, find two graphs $G$ and $H$ such that $G∪H = K_6$ and $G$ and $H$ are both planar.)

Planar Graph Embedding with fixed vertex positions

Number of simple paths in undirected planar graph

Adding an edge to a maximal planar graph results in topological minors of both $K_5,K_{3,3}$.

All 4-connected planar graphs are Hamiltonian-connected

Minimum number of colors needed to color the graph

Self-complementary graph exercise

Trending Questions

Popular # Hahtags

Popular Questions