Abstract
We consider the graphs P(m, n) with average degree between 3.5 and 4, made up of m identical pieces together with n identical pieces glued together in a circular fashion, such that in any drawing of P(m, n) on the plane, there are exactly three pairwise edges crossings, and when deleting any edge of the graph, the number of crossings of the remaining graph decreases. We then embed P(m, n) into a book such that the vertices are put on a line called the spine and the edges are put on half-planes called the pages, which have the spine as their common boundary, without crossings. In this paper, we show that the minimal number of pages needed to embed P(m, n) into a book is three.
Sign-in/Register to access full text options 
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
