Question

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

score 38 · Answer 1 · 2026-04-15 08:14:42

38

Views

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

Published on 15 Apr 2026 - 8:14

score 1.1k · Answer 2 · 2026-04-16 14:09:42

1.1k

Views

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

Published on 16 Apr 2026 - 14:09

score 124 · Answer 3 · 2026-04-14 08:07:04

124

Views

Vertex degrees in planar graphs

Published on 14 Apr 2026 - 8:07

score 833 · Answer 4 · 2026-04-16 12:54:22

833

Views

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

Published on 16 Apr 2026 - 12:54

score 363 · Answer 5 · 2026-04-16 19:42:00

363

Views

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

Published on 16 Apr 2026 - 19:42

score 196 · Answer 6 · 2026-04-16 01:54:40

196

Views

Non-Planar graph maximum degree proof

Published on 16 Apr 2026 - 1:54

score 61 · Answer 7 · 2026-04-17 05:19:28

61

Views

Planar graph and bipartite sub graph

Published on 17 Apr 2026 - 5:19

score 393 · Answer 8 · 2026-04-15 22:15:15

393

Views

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

Published on 15 Apr 2026 - 22:15

score 1.7k · Answer 9 · 2026-04-16 02:58:40

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 89 · Answer 10 · 2026-04-15 05:47:11

89

Views

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

Published on 15 Apr 2026 - 5:47

score 1.2k · Answer 11 · 2026-04-10 21:12:25

1.2k

Views

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

Published on 10 Apr 2026 - 21:12

score 1.2k · Answer 12 · 2026-04-16 09:13:38

1.2k

Views

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

Published on 16 Apr 2026 - 9:13

score 152 · Answer 13 · 2026-04-15 05:33:43

152

Views

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

Published on 15 Apr 2026 - 5:33

score 95 · Answer 14 · 2026-04-12 05:59:29

95

Views

Natural extensions of Fary's Theorem?

Published on 12 Apr 2026 - 5:59

score 394 · Answer 15 · 2026-04-14 05:06:46

394

Views

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

Published on 14 Apr 2026 - 5:06

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