Pages that link to "Item:Q1739109"

The following pages link to Track layouts, layered path decompositions, and leveled planarity (Q1739109):

Displaying 22 items.

• Algorithmic constructions of relative train track maps and CTs (Q1785958) (← links)
• On the queue number of planar graphs (Q2151450) (← links)
• 4-connected triangulations on few lines (Q2206872) (← links)
• Line and plane cover numbers revisited (Q2206873) (← links)
• An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
• Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
• Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
• On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
• Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
• Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
• Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
• Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
• Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
• Better bounds for poset dimension and boxicity (Q5217895) (← links)
• Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
• Multilevel Planarity (Q5856666) (← links)
• Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
• 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
• Separating layered treewidth and row treewidth (Q6045398) (← links)
• The product structure of squaregraphs (Q6143380) (← links)
• 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)