(3,2)-Track Layout of Bipartite Graph Subdivisions

DOI10.1007/978-3-540-89550-3_14MaRDI QIDQ5302747zbMATH OpenOpenAlexFDO

Authors Miki Shimabara Miyauchi

Publication date 13 January 2009

Published in Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89550-3_14

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Stacks, queues and tracks: layouts of graph subdivisions
• Graph Drawing
• scientific article; zbMATH DE number 2159655
• Track layout is hard
• Improved bounds for track numbers of planar graphs

Cites work

• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• Queue layouts of graph products and powers
• Stacks, queues and tracks: layouts of graph subdivisions

Cited in

(3)

• Track layout is hard
• Stacks, queues and tracks: layouts of graph subdivisions
• Graph Drawing

This page was built for publication: (3,2)-Track Layout of Bipartite Graph Subdivisions

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