Two Results on Layered Pathwidth and Linear Layouts

DOI10.7155/jgaa.00549zbMath1452.05177arXiv2004.03571OpenAlexW3120731689MaRDI QIDQ5144880

Vida Dujmović, Céline Yelle, Pat Morin

Publication date: 19 January 2021

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.03571

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

2-Layer Graph Drawings with Bounded Pathwidth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Track layouts, layered path decompositions, and leveled planarity
• The book thickness of 1-planar graphs is constant
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Track Layout Is Hard
• Layouts of Expander Graphs
• Laying Out Graphs Using Queues
• Planar graphs have bounded nonrepetitive chromatic number
• Planar Graphs Have Bounded Queue-Number
• Shorter Labeling Schemes for Planar Graphs
• Improved bounds for centered colorings
• Layout of Graphs with Bounded Tree-Width
• Structure of Graphs with Locally Restricted Crossings

This page was built for publication: Two Results on Layered Pathwidth and Linear Layouts