A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the conjecture holds for subfamilies of upward outerplanar graphs, namely those whose underlying graph is an internally-triangulated outerpath or a cactus, and those whose biconnected components are st????????stitalic_s itali


Who Upvoted this Story

What is Plikli?

Plikli is an open source content management system that lets you easily create your own user-powered website.

Latest Comments