Question

Faithful action on trees ensures that the action is faithfull of plane graphs?

score 35 · Answer 1 · 2018-04-20 10:16:07

35

Views

Faithful action on trees ensures that the action is faithfull of plane graphs?

Published on 20 Apr 2018 - 10:16

score 1.1k · Answer 2 · 2018-05-03 21:36:55

1.1k

Views

Obtaining a planar graph from a non-planar graph through vertex addition

Published on 03 May 2018 - 21:36

score 121 · Answer 3 · 2018-05-14 14:19:50

121

Views

Vertex degrees in planar graphs

Published on 14 May 2018 - 14:19

score 830 · Answer 4 · 2018-05-16 19:37:08

830

Views

every planar graph can be expressed as a union of five edge-disjoint forests

Published on 16 May 2018 - 19:37

score 358 · Answer 5 · 2018-05-17 15:51:17

358

Views

Algorithms for "pleasing" drawings of planar graphs, possibly on sphere

Published on 17 May 2018 - 15:51

score 192 · Answer 6 · 2018-05-18 19:52:49

192

Views

Non-Planar graph maximum degree proof

Published on 18 May 2018 - 19:52

score 58 · Answer 7 · 2026-03-22 10:48:45

58

Views

Planar graph and bipartite sub graph

Published on 22 Mar 2026 - 10:48

score 390 · Answer 8 · 2018-05-22 05:48:56

390

Views

every planar graph can be expressed as a union of (maximum) five forests

Published on 22 May 2018 - 5:48

score 1.7k · Answer 9 · 2018-05-22 08:19:42

Let G be a simple connected planar graph with at least three vertices. Prove that if every face of G has degree 3, then G has an even number of faces

score 86 · Answer 10 · 2018-05-22 13:44:48

86

Views

Does this unit distance graph with 137 vertices need five colors?

Published on 22 May 2018 - 13:44

score 1.2k · Answer 11 · 2018-05-23 12:18:35

1.2k

Views

How many colorings are in a complete bipartite graph which is planar and has Eurlerian path?

Published on 23 May 2018 - 12:18

score 1.2k · Answer 12 · 2018-05-23 13:39:22

1.2k

Views

Is there a $6$ vertex planar graph which which has Eulerian path of length $9$?

Published on 23 May 2018 - 13:39

score 149 · Answer 13 · 2018-05-24 10:51:17

149

Views

Given a cycle of a planar graph, check if it is a face of a planar embedding

Published on 24 May 2018 - 10:51

score 91 · Answer 14 · 2018-05-24 13:39:50

91

Views

Natural extensions of Fary's Theorem?

Published on 24 May 2018 - 13:39

score 391 · Answer 15 · 2018-05-25 18:20:18

391

Views

Planar graph $G$ that does not contain any cycle of length $\leq k-1$

Published on 25 May 2018 - 18:20

List Question

Faithful action on trees ensures that the action is faithfull of plane graphs?

Obtaining a planar graph from a non-planar graph through vertex addition

Vertex degrees in planar graphs

every planar graph can be expressed as a union of five edge-disjoint forests

Algorithms for "pleasing" drawings of planar graphs, possibly on sphere

Non-Planar graph maximum degree proof

Planar graph and bipartite sub graph

every planar graph can be expressed as a union of (maximum) five forests

Let G be a simple connected planar graph with at least three vertices. Prove that if every face of G has degree 3, then G has an even number of faces

Does this unit distance graph with 137 vertices need five colors?

How many colorings are in a complete bipartite graph which is planar and has Eurlerian path?

Is there a $6$ vertex planar graph which which has Eulerian path of length $9$?

Given a cycle of a planar graph, check if it is a face of a planar embedding

Natural extensions of Fary's Theorem?

Planar graph $G$ that does not contain any cycle of length $\leq k-1$

Trending Questions

Popular # Hahtags

Popular Questions