List questions from planar-graphs

Published on 30 May 2018 - 22:13

154

Views

Condition that the faces of a graph be unique?

Published on 05 Jun 2018 - 8:00

106

Views

Is every planar graph a possible dual graph of a voronoi diagram?

Published on 23 Feb 2026 - 3:29

77

Views

Materials to read for Graph Theory.

Published on 22 Mar 2026 - 3:34

84

Views

Planar Graph - Proof

Published on 14 Jun 2018 - 13:47

169

Views

Isometrically embed a pentagon into $\mathbb{R}^2$

Published on 25 Mar 2026 - 1:21

139

Views

Isometrically embed $K$-gon into $\mathbb{R}^N$

Published on 25 Mar 2026 - 1:21

333

Views

Complement of 7-vertex planar graph

Published on 22 Jun 2018 - 14:06

231

Views

Determining (parity of) maximum path length from adjacency matrix. Can I avoid having to square?

Published on 22 Jun 2018 - 20:18

105

Views

How can we interchange the colors of districts in 4 color problem

Published on 23 Jun 2018 - 4:02

863

Views

Proof that it exists at least one graph G planar, bipartite and with $\delta$(G) $\ge$ 4

Published on 25 Jun 2018 - 22:59

129

Views

I cannot determine if this graph is planar. I have tried all tests but cannot see

Published on 20 Jul 2018 - 0:50

633

Views

Kuratowski's theorem in every case?

Published on 21 Jul 2018 - 17:17

254

Views

Finding "holes" in planar graphs

Published on 26 Jul 2018 - 23:53

509

Views

Are there only seven 3-connected planar graphs with certain symmetries?

Published on 27 Jul 2018 - 10:34

List Question

These two trees are not equivalent

Condition that the faces of a graph be unique?

Is every planar graph a possible dual graph of a voronoi diagram?

Materials to read for Graph Theory.

Planar Graph - Proof

Isometrically embed a pentagon into $\mathbb{R}^2$

Isometrically embed $K$-gon into $\mathbb{R}^N$

Complement of 7-vertex planar graph

Determining (parity of) maximum path length from adjacency matrix. Can I avoid having to square?

How can we interchange the colors of districts in 4 color problem

Proof that it exists at least one graph G planar, bipartite and with $\delta$(G) $\ge$ 4

I cannot determine if this graph is planar. I have tried all tests but cannot see

Kuratowski's theorem in every case?

Finding "holes" in planar graphs

Are there only seven 3-connected planar graphs with certain symmetries?

Trending Questions

Popular # Hahtags

Popular Questions