Pathwidth of 2-layer k-planar graphs

DOI10.57717/CGT.V5I1.101MaRDI QIDQ6847365zbMATH OpenFDO

Authors Yuto Okada

Publication date 9 March 2026

Published in CGT. Computing in Geometry and Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.57717/CGT.V5I1.101

zbMATH Keywords

2-layer \(k\)-planar graphsgraph drawingpathwidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• 2-Layer k-Planar Graphs
• A partial k-arboretum of graphs with bounded treewidth
• Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
• Bounding the treewidth of outer k-planar graphs via triangulations
• Crossing Number is NP-Complete
• Graph theory (to appear)
• Interval graphs and searching
• Laying Out Graphs Using Queues
• Lower bounds on the pathwidth of some grid-like graphs
• On Layered Fan-Planar Graph Drawings
• On the parameterized complexity of layered graph drawing
• Recontamination does not help to search a graph
• Searching and pebbling

This page was built for publication: Pathwidth of 2-layer \(k\)-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847365)