Maximum Pagenumber-k Subgraph is NP-Complete

Abstract

Given a graph $G$ with a total order defined on its vertices, the Maximum Pagenumber-$k$ Subgraph Problem asks for a maximum subgraph $G^{\prime }$ of $G$ such that $G^{\prime }$ can be embedded into a $k$-book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for $k\ge 2$.

6 pages, 1 figure

References in corpus (1)

• Tabulation of Noncrossing Acyclic Digraphs