Question

A problem on finding the no. of impossible connections in a plane of utilities and houses.

score 349 · Answer 1 · 2026-03-25 15:53:02

349

Views

A problem on finding the no. of impossible connections in a plane of utilities and houses.

Published on 25 Mar 2026 - 15:53

score 230 · Answer 2 · 2019-09-08 19:13:40

230

Views

Two graphs G and F are isomorphic iff there is a bijection between E(G) an E(F)

Published on 08 Sep 2019 - 19:13

score 52 · Answer 3 · 2019-09-09 17:53:48

52

Views

cycle structure of bounded genus graphs

Published on 09 Sep 2019 - 17:53

score 144 · Answer 4 · 2019-09-11 13:09:41

144

Views

How to solve a "foraging" problem on a directed graph?

Published on 11 Sep 2019 - 13:09

score 117 · Answer 5 · 2019-09-20 17:09:39

117

Views

What are some theorems giving lower bounds on the size of a maximum indepedent set of verticies of a planar graph?

Published on 20 Sep 2019 - 17:09

score 256 · Answer 6 · 2019-09-25 12:30:13

256

Views

How to check if the given graph is planar or not?

Published on 25 Sep 2019 - 12:30

score 370 · Answer 7 · 2019-09-26 07:02:38

370

Views

How to show that this graph is planar?-Formal Proof

Published on 26 Sep 2019 - 7:02

score 41 · Answer 8 · 2019-09-28 11:57:49

41

Views

How to arrange elements in a matrix such that it respects adjacency matrix?

Published on 28 Sep 2019 - 11:57

score 17 · Answer 9 · 2019-10-01 04:07:58

17

Views

Equivalence of planar point configurations with respect to crossings

Published on 01 Oct 2019 - 4:07

score 2.6k · Answer 10 · 2014-03-14 10:51:24

2.6k

Views

Can there exist an uncountable planar graph?

Published on 14 Mar 2014 - 10:51

score 2.7k · Answer 11 · 2014-03-19 21:17:52

2.7k

Views

Planar and Euler's Formula Question

Published on 19 Mar 2014 - 21:17

score 21k · Answer 12 · 2014-03-20 19:47:13

21k

Views

Prove that Petersen's graph is non-planar using Euler's formula

Published on 20 Mar 2014 - 19:47

score 2.3k · Answer 13 · 2014-03-24 23:52:10

2.3k

Views

Let G= (V,E) be an undirected connected loop-free graph.Prove that...

Published on 24 Mar 2014 - 23:52

score 3.2k · Answer 14 · 2014-03-25 00:55:26

3.2k

Views

Suppose G is an unconnected planar graph, with v nodes, e edges, and f faces, where v ≥ 3.

Published on 25 Mar 2014 - 0:55

score 5.8k · Answer 15 · 2014-04-01 03:41:41

5.8k

Views

Finding Number of Edges and Vertices in Icosahedron

Published on 01 Apr 2014 - 3:41

List Question

A problem on finding the no. of impossible connections in a plane of utilities and houses.

Two graphs G and F are isomorphic iff there is a bijection between E(G) an E(F)

cycle structure of bounded genus graphs

How to solve a "foraging" problem on a directed graph?

What are some theorems giving lower bounds on the size of a maximum indepedent set of verticies of a planar graph?

How to check if the given graph is planar or not?

How to show that this graph is planar?-Formal Proof

How to arrange elements in a matrix such that it respects adjacency matrix?

Equivalence of planar point configurations with respect to crossings

Can there exist an uncountable planar graph?

Planar and Euler's Formula Question

Prove that Petersen's graph is non-planar using Euler's formula

Let G= (V,E) be an undirected connected loop-free graph.Prove that...

Suppose G is an unconnected planar graph, with v nodes, e edges, and f faces, where v ≥ 3.

Finding Number of Edges and Vertices in Icosahedron

Trending Questions

Popular # Hahtags

Popular Questions