Pages that link to "Item:Q5925712"

The following pages link to On the upward book thickness problem: combinatorial and complexity results (Q5925712):

Displaying 2 items.

• Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
• Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)