图的混合页数
The Mixed Page Number of Graphs
摘要：
图的线性布局通常由总顶点顺序和将边划分为非交叉边（称为堆栈）或非嵌套边（称为队列）的集合组成。图的堆栈（队列）数量是线性布局中所需堆栈（队列）的最小数量。混合线性布局通过允许每组边形成堆栈或队列来组合这些布局。在这项工作中，我们开始研究的混合页数的图，对应于最小数量的这样的集合。首先，我们研究了具有有界混合页数的图的边密度。然后，我们专注于完全和完全二部图，我们推导出他们的混合页数的上下界。我们的研究结果表明，与两种传统布局相比，组合堆栈和队列在各种方面都更强大。
英文摘要：
A linear layout of a graph typically consists of a total vertex order, and a partition of the edges into sets of either non-crossing edges, called stacks, or non-nested edges, called queues. The stack (queue) number of a graph is the minimum number of required stacks (queues) in a linear layout. Mixed linear layouts combine these layouts by allowing each set of edges to form either a stack or a queue. In this work we initiate the study of the mixed page number of a graph which corresponds to the minimum number of such sets. First, we study the edge density of graphs with bounded mixed page number. Then, we focus on complete and complete bipartite graphs, for which we derive lower and upper bounds on their mixed page number. Our findings indicate that combining stacks and queues is more powerful in various ways compared to the two traditional layouts.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
