Skip to main content
Notice removed Draw attention by CommunityBot
Bounty Ended with no winning answer by CommunityBot
Notice added Draw attention by Lorenzo Pompili
Bounty Started worth 100 reputation by Lorenzo Pompili
Notice removed Draw attention by Alex Ravsky
Bounty Ended with Lorenzo Pompili's answer chosen by Alex Ravsky
Notice added Draw attention by Alex Ravsky
Bounty Started worth 100 reputation by Alex Ravsky
Notice removed Draw attention by Till
Bounty Ended with Alex Ravsky's answer chosen by Till
I removed parentheses and highlighted more the fact that edges are straight lines, as the term “plane” can also refer to graphs with curved edges.
Source Link

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane meansHere by “plane” I mean that all edges are drawn as straight line segmentsstraight line segments which do not intersect.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a connected graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a connected graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. Here by “plane” I mean that all edges are drawn as straight line segments which do not intersect.

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a connected graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

connected
Source Link
Wlod AA
  • 4.8k
  • 17
  • 23

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a connected graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a connected graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

Notice added Draw attention by Till
Bounty Started worth 50 reputation by Till
added 66 characters in body
Source Link
Till
  • 479
  • 3
  • 9

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding.

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

A graph $G = (V,E)$ has geometric thickness two if there exists an embedding $\varphi: V \rightarrow \mathbb{R}^2$ and a decomposition $E = E_1\cup E_2$ such that $G_1 = (V,E_1)$ and $G_2 = (V,E_2)$ are both plane with this embedding. (Plane means that all edges are drawn as straight line segments.)

For instance, it is easy to see that $K_5$ has thickness two.

I am looking for a graph $G$ with geometric thickness two such that for any valid embedding and any valid decomposition, both graphs $G_1$ and $G_2$ are connected.

removed capitals from title, changed tag
Link
YCor
  • 63.9k
  • 5
  • 187
  • 286
Loading
Source Link
Till
  • 479
  • 3
  • 9
Loading