Question

Finding $K_{3,3}$-subdivision when adding edge to maximal planar graph.

score 526 · Answer 1 · 2026-04-14 14:43:33

526

Views

Finding $K_{3,3}$-subdivision when adding edge to maximal planar graph.

Published on 14 Apr 2026 - 14:43

score 371 · Answer 2 · 2026-04-15 04:10:16

371

Views

Algorithm for generating a graph based on a planar graph?

Published on 15 Apr 2026 - 4:10

score 268 · Answer 3 · 2026-05-10 18:27:46

268

Views

A new graph invariant? The maximum number of non-equivalent colorings with $n$ colors.

Published on 10 May 2026 - 18:27

score 30 · Answer 4 · 2026-04-14 14:53:57

30

Views

let H be minor of a graph G. Is it always true that embedding surface of H is less than embedding surface of G

Published on 14 Apr 2026 - 14:53

score 642 · Answer 5 · 2026-04-15 17:26:39

642

Views

Generating the $n^{th}$ full binary tree over $N$ labeled leaves

Published on 15 Apr 2026 - 17:26

score 213 · Answer 6 · 2026-04-16 23:14:06

213

Views

Connected planar graph with $n \geq 4$ vertices and $m$ edges, all edges in a cycle and no 2 3-cycles share an edge: show $m \leq \frac{12}{5}(n-2)$

Published on 16 Apr 2026 - 23:14

score 79 · Answer 7 · 2026-04-17 11:49:17

79

Views

Constructing a graph with radius two.

Published on 17 Apr 2026 - 11:49

score 156 · Answer 8 · 2026-04-12 22:26:48

156

Views

Prove $C_n^2$ is planar

Published on 12 Apr 2026 - 22:26

score 335 · Answer 9 · 2026-04-16 06:55:28

335

Views

A convex polyhedron has 20 vertices and 12 faces. Each face of the polyhedron is bounded by the same number of edges. What is this common number?

Published on 16 Apr 2026 - 6:55

score 1.1k · Answer 10 · 2026-04-17 06:02:58

In the simple planar graph G the degree of each vertex is at least 5. Show that in this case G contains at least 12 vertices of degree 5.

score 112 · Answer 11 · 2026-04-16 14:50:23

112

Views

Let G be a simple planar graph on 13 vertices. Prove that at least one of G and its complement G is not planar.

Published on 16 Apr 2026 - 14:50

score 143 · Answer 12 · 2026-04-30 10:17:11

143

Views

Planar subgraph.

Published on 30 Apr 2026 - 10:17

score 2.2k · Answer 13 · 2026-04-17 12:18:57

2.2k

Views

Prove that if the length of a smallest cycle in $G$ is $5$, then $m ≤ 5/3(n-2)$.

Published on 17 Apr 2026 - 12:18

score 984 · Answer 14 · 2026-04-11 05:43:00

984

Views

The relationship between the Euler characteristic and the fundamental group of finite connected graphs

Published on 11 Apr 2026 - 5:43

score 108 · Answer 15 · 2026-04-30 05:56:31

108

Views

Dual Graph Score

Published on 30 Apr 2026 - 5:56

List Question

Finding $K_{3,3}$-subdivision when adding edge to maximal planar graph.

Algorithm for generating a graph based on a planar graph?

A new graph invariant? The maximum number of non-equivalent colorings with $n$ colors.

let H be minor of a graph G. Is it always true that embedding surface of H is less than embedding surface of G

Generating the $n^{th}$ full binary tree over $N$ labeled leaves

Connected planar graph with $n \geq 4$ vertices and $m$ edges, all edges in a cycle and no 2 3-cycles share an edge: show $m \leq \frac{12}{5}(n-2)$

Constructing a graph with radius two.

Prove $C_n^2$ is planar

A convex polyhedron has 20 vertices and 12 faces. Each face of the polyhedron is bounded by the same number of edges. What is this common number?

In the simple planar graph G the degree of each vertex is at least 5. Show that in this case G contains at least 12 vertices of degree 5.

Let G be a simple planar graph on 13 vertices. Prove that at least one of G and its complement G is not planar.

Planar subgraph.

Prove that if the length of a smallest cycle in $G$ is $5$, then $m ≤ 5/3(n-2)$.

The relationship between the Euler characteristic and the fundamental group of finite connected graphs

Dual Graph Score

Trending Questions

Popular # Hahtags

Popular Questions