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' of G such that G' 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 ≥ 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.