Improved lower bounds on book crossing numbers of complete graphs

• المؤلفون الرئيسيون: Salazar, G., Pasechnik, Dmitrii V., De Klerk, Etienne.
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2014
• الموضوعات: DRNTU::Science::Mathematics::Discrete mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/101539; http://hdl.handle.net/10220/18655
• المؤسسة: Nanyang Technological University

A book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page bo...