Question

Greedy Algorithm for planar graphs

score 141 · Answer 1 · 2020-05-29 23:49:09

141

Views

Greedy Algorithm for planar graphs

Published on 29 May 2020 - 23:49

score 283 · Answer 2 · 2020-05-31 21:40:58

283

Views

$G$ is a planar, connected graph. Let $n$ be number of vertices, $m$ number of edges and $f$ number of faces. Prove that dual graph $G$ has $f(G)=n$

Published on 31 May 2020 - 21:40

score 54 · Answer 3 · 2026-03-26 01:10:34

54

Views

Dificulty to prove chromatic number of directed planar graphs

Published on 26 Mar 2026 - 1:10

score 54 · Answer 4 · 2020-06-01 08:55:02

54

Views

Let $\varepsilon > 0$ be fixed. Then the random graph $G(n,m=(1+\varepsilon))$ is a.a.s not planar.

Published on 01 Jun 2020 - 8:55

score 30 · Answer 5 · 2020-06-02 01:50:08

30

Views

On the number of faces of dual graph

Published on 02 Jun 2020 - 1:50

score 86 · Answer 6 · 2026-03-25 20:41:27

86

Views

chromatic number in directed graphs

Published on 25 Mar 2026 - 20:41

score 4k · Answer 7 · 2020-06-05 23:49:49

4k

Views

How to Find K3,3 and K5 configuration of nonplanar graphs

Published on 05 Jun 2020 - 23:49

score 46 · Answer 8 · 2020-06-09 17:59:01

46

Views

Clarification of a case in the proof of Euler's Formula as dealt with in Kenneth Rosen's "Discrete Mathematics" (5th ed)

Published on 09 Jun 2020 - 17:59

score 855 · Answer 9 · 2020-06-10 11:54:51

855

Views

Prove that a planar graph with all vertices degree $3$ must has a face with at most $5$ edges.

Published on 10 Jun 2020 - 11:54

score 61 · Answer 10 · 2020-06-11 00:04:23

61

Views

Generalization of complete bipartite graphs

Published on 11 Jun 2020 - 0:04

score 51 · Answer 11 · 2020-06-12 08:36:21

51

Views

Corollary of Art Gallery Theorem (Interior Guards)

Published on 12 Jun 2020 - 8:36

score 533 · Answer 12 · 2020-06-13 17:35:11

533

Views

Sum of squares of degrees in a planar graph

Published on 13 Jun 2020 - 17:35

score 400 · Answer 13 · 2026-03-25 18:56:31

400

Views

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

Published on 25 Mar 2026 - 18:56

score 323 · Answer 14 · 2020-06-20 02:19:12

323

Views

Prove this graph is not planar.

Published on 20 Jun 2020 - 2:19

score 77 · Answer 15 · 2026-03-25 12:33:18

77

Views

Relation of Adjacency matrices of 2 graphs

Published on 25 Mar 2026 - 12:33

List Question

Greedy Algorithm for planar graphs

$G$ is a planar, connected graph. Let $n$ be number of vertices, $m$ number of edges and $f$ number of faces. Prove that dual graph $G$ has $f(G)=n$

Dificulty to prove chromatic number of directed planar graphs

Let $\varepsilon > 0$ be fixed. Then the random graph $G(n,m=(1+\varepsilon))$ is a.a.s not planar.

On the number of faces of dual graph

chromatic number in directed graphs

How to Find K3,3 and K5 configuration of nonplanar graphs

Clarification of a case in the proof of Euler's Formula as dealt with in Kenneth Rosen's "Discrete Mathematics" (5th ed)

Prove that a planar graph with all vertices degree $3$ must has a face with at most $5$ edges.

Generalization of complete bipartite graphs

Corollary of Art Gallery Theorem (Interior Guards)

Sum of squares of degrees in a planar graph

Given a binary tree with N labelled leaves, is it possible to find its unique number in the Catalan range?

Prove this graph is not planar.

Relation of Adjacency matrices of 2 graphs

Trending Questions

Popular # Hahtags

Popular Questions