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 177 · Answer 1 · 2026-04-15 06:55:04

177

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 15 Apr 2026 - 6:55

score 1.8k · Answer 2 · 2026-04-16 10:59:05

1.8k

Views

Is L(K4) graph planar?

Published on 16 Apr 2026 - 10:59

score 828 · Answer 3 · 2026-04-14 23:49:34

828

Views

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

Published on 14 Apr 2026 - 23:49

score 694 · Answer 4 · 2026-04-14 04:58:05

694

Views

Related to girth of planar graphs

Published on 14 Apr 2026 - 4:58

score 198 · Answer 5 · 2026-04-14 07:03:46

198

Views

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

Published on 14 Apr 2026 - 7:03

score 2.2k · Answer 6 · 2026-04-16 17:42:01

2.2k

Views

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

Published on 16 Apr 2026 - 17:42

score 522 · Answer 7 · 2026-05-10 17:37:02

522

Views

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

Published on 10 May 2026 - 17:37

score 1.9k · Answer 8 · 2026-04-13 22:26:41

1.9k

Views

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

Published on 13 Apr 2026 - 22:26

score 255 · Answer 9 · 2026-04-17 00:32:52

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 160 · Answer 10 · 2026-04-16 06:55:30

160

Views

Planar Graph Embedding with fixed vertex positions

Published on 16 Apr 2026 - 6:55

score 554 · Answer 11 · 2026-04-17 01:12:45

554

Views

Number of simple paths in undirected planar graph

Published on 17 Apr 2026 - 1:12

score 323 · Answer 12 · 2026-04-14 09:17:37

323

Views

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

Published on 14 Apr 2026 - 9:17

score 1.9k · Answer 13 · 2026-05-10 17:36:24

1.9k

Views

All 4-connected planar graphs are Hamiltonian-connected

Published on 10 May 2026 - 17:36

score 2.3k · Answer 14 · 2026-04-16 10:23:01

2.3k

Views

Minimum number of colors needed to color the graph

Published on 16 Apr 2026 - 10:23

score 371 · Answer 15 · 2026-04-14 08:22:17

371

Views

Self-complementary graph exercise

Published on 14 Apr 2026 - 8:22

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