Abstract

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 find upper and lower bounds of the right order of magnitude depending on the number of edges in the page with the least number of edges.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call