Sep 4, 2019 · We consider the problem of determining the 2-page book crossing number of the complete graph when the number of edges in each page is given.
Upper and lower bounds of the right order of magnitude depending on the number of edges in the page with the least number of edge are found.
Sep 4, 2019 · A k-page book is the union of k-half planes in the space with common boundary and disjoint interiors. The common boundary is a straight line ...
We consider the problem of determining the 2-page book crossing number of the complete graph \( K_n \) when the number of edges in each page is given.
We consider the problem of determining the 2-page book crossing number of the complete graph Kn when the number of edges in each page is given. We find up- per ...
Jun 17, 2012 · In this paper we develop a novel and innovative technique to investigate crossings in drawings of Kn, and use it to prove that ν2(Kn) = Z(n). To ...
Here In this paper we develop a novel and innovative technique to investigate crossings in drawings of $K_{n}$, and use it to prove that $\nu_{2}(K_{n}) = Z(n) ...
Jun 4, 2013 · On the Crossing Number of 2-Page Book Drawings of \(K_{n}\) with Prescribed Number of Edges in Each Page. Article 04 September 2019. The Same ...
Missing: Kn | Show results with:Kn
People also ask
Feb 14, 2013 · These drawings are 2-page book drawings, that is, drawings where all the vertices are ... minimum number of crossings determined by a 2-page book ...
Missing: Prescribed | Show results with:Prescribed
On the Crossing Number of 2-Page Book Drawings of Kn with Prescribed Number of Edges in Each Page ; ISSN · 0911-0119 ; Year of publication · 2020 ; Volume · 36 ; Issue ...