Question

Understanding the proof: A spanning tree in $G$ implies a spanning tree in dual graph

score 855 · Answer 1 · 2015-10-16 19:15:12

855

Views

Understanding the proof: A spanning tree in $G$ implies a spanning tree in dual graph

Published on 16 Oct 2015 - 19:15

score 21 · Answer 2 · 2026-03-23 00:38:37

21

Views

Problem with planar connected graphs

Published on 23 Mar 2026 - 0:38

score 799 · Answer 3 · 2015-10-27 12:08:13

799

Views

The cycle space of a planar graph is the cut space of its dual graph

Published on 27 Oct 2015 - 12:08

score 72 · Answer 4 · 2015-10-27 21:09:51

72

Views

Interesting planar graph coloring task - estimate colours for double planar graph

Published on 27 Oct 2015 - 21:09

score 370 · Answer 5 · 2026-02-23 09:42:59

370

Views

Consequences of cycle space cut space duality

Published on 23 Feb 2026 - 9:42

score 1.9k · Answer 6 · 2015-11-01 16:40:58

1.9k

Views

Show in a maximal planar graph every face is a triangle.

Published on 01 Nov 2015 - 16:40

score 2.1k · Answer 7 · 2026-02-24 14:20:06

2.1k

Views

Prove that a graph is a maximal planar graph if and only if $e = 3v − 6$

Published on 24 Feb 2026 - 14:20

score 117 · Answer 8 · 2015-11-02 06:02:51

117

Views

if $G$ is a connected planar graph with $|V| = v$ and $|E| =e$ and each cycle in the graph is of at least length $k$

Published on 02 Nov 2015 - 6:02

score 7.5k · Answer 9 · 2015-11-02 20:35:21

7.5k

Views

Suppose G is a connected planar simple graph with $e$ edges and $v$ vertices with no cycles of length 4 or less...

Published on 02 Nov 2015 - 20:35

score 125 · Answer 10 · 2015-11-03 15:39:43

125

Views

Understanding the proof: Maclean's Planarity Criteria

Published on 03 Nov 2015 - 15:39

score 284 · Answer 11 · 2026-03-09 05:53:25

284

Views

Colorability of planar graphs.

Published on 09 Mar 2026 - 5:53

score 253 · Answer 12 · 2026-03-27 05:42:42

253

Views

when do we say if two graphs are isomorphic and when do we say they are the same?

Published on 27 Mar 2026 - 5:42

score 1.6k · Answer 13 · 2015-11-11 14:54:36

1.6k

Views

What would be the most efficient way to detect all closed paths in a collection of segments and connectors?

Published on 11 Nov 2015 - 14:54

score 137 · Answer 14 · 2015-11-11 22:14:30

137

Views

Fáry's theorem for infinite graphs

Published on 11 Nov 2015 - 22:14

score 4.7k · Answer 15 · 2015-11-22 14:27:25

4.7k

Views

Total number of edges in a triangle mesh with $n$ vertices

Published on 22 Nov 2015 - 14:27

List Question

Understanding the proof: A spanning tree in $G$ implies a spanning tree in dual graph

Problem with planar connected graphs

The cycle space of a planar graph is the cut space of its dual graph

Interesting planar graph coloring task - estimate colours for double planar graph

Consequences of cycle space cut space duality

Show in a maximal planar graph every face is a triangle.

Prove that a graph is a maximal planar graph if and only if $e = 3v − 6$

if $G$ is a connected planar graph with $|V| = v$ and $|E| =e$ and each cycle in the graph is of at least length $k$

Suppose G is a connected planar simple graph with $e$ edges and $v$ vertices with no cycles of length 4 or less...

Understanding the proof: Maclean's Planarity Criteria

Colorability of planar graphs.

when do we say if two graphs are isomorphic and when do we say they are the same?

What would be the most efficient way to detect all closed paths in a collection of segments and connectors?

Fáry's theorem for infinite graphs

Total number of edges in a triangle mesh with $n$ vertices

Trending Questions

Popular # Hahtags

Popular Questions