On the Crossing Number of 2-Page Book Drawings of K_n with Prescribed Number of Edges in Each Page

Bernardo Ábrego,Silvia Fernández-Merchant,Evgeniya Lagoda,Pedro Ramos

Graphs and Combinatorics（2019）

引用 0|浏览8

暂无评分

摘要

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.

查看译文

关键词

Crossing number,2-Page book,Complete graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要