A book embedding of a graph $G$ consists of placing the vertices of $G$ on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is the minimum number of pages in which the graph $G$ can be embedded.

Recently, I wondered whether the following result is right:

Let $ {G}$ be a simple connected graph, a graph $ {G'}$ is from the graph $G$ by adding a new vertex on any edge $e$ of $G$, then $bt( {G'})=bt(G).$

I will appreciate it if someone could give any suggestions.