Question

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

score 523 · Answer 1 · 2019-01-05 02:51:35

523

Views

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

Published on 05 Jan 2019 - 2:51

score 368 · Answer 2 · 2019-01-07 17:53:16

368

Views

Algorithm for generating a graph based on a planar graph?

Published on 07 Jan 2019 - 17:53

score 262 · Answer 3 · 2026-03-25 04:42:54

262

Views

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

Published on 25 Mar 2026 - 4:42

score 27 · Answer 4 · 2019-01-29 14:18:19

27

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 29 Jan 2019 - 14:18

score 639 · Answer 5 · 2019-02-05 19:18:54

639

Views

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

Published on 05 Feb 2019 - 19:18

score 210 · Answer 6 · 2019-02-14 17:58:33

210

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 14 Feb 2019 - 17:58

score 76 · Answer 7 · 2019-02-18 12:35:26

76

Views

Constructing a graph with radius two.

Published on 18 Feb 2019 - 12:35

score 153 · Answer 8 · 2019-03-04 04:37:50

153

Views

Prove $C_n^2$ is planar

Published on 04 Mar 2019 - 4:37

score 332 · Answer 9 · 2019-03-05 23:57:23

332

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 05 Mar 2019 - 23:57

score 1.1k · Answer 10 · 2019-03-06 01:05:48

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 109 · Answer 11 · 2019-03-06 22:39:37

109

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 06 Mar 2019 - 22:39

score 139 · Answer 12 · 2019-03-07 18:16:22

139

Views

Planar subgraph.

Published on 07 Mar 2019 - 18:16

score 2.2k · Answer 13 · 2019-03-10 02:23:03

2.2k

Views

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

Published on 10 Mar 2019 - 2:23

score 981 · Answer 14 · 2019-03-10 09:51:01

981

Views

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

Published on 10 Mar 2019 - 9:51

score 104 · Answer 15 · 2019-03-10 18:28:09

104

Views

Dual Graph Score

Published on 10 Mar 2019 - 18:28

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