k-spine, 1-bend planarity

DOI10.1016/J.TCS.2006.02.024MaRDI QIDQ2503294zbMATH OpenOpenAlexWikidataFDO

Authors Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman

Publication date 14 September 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.02.024

zbMATH Keywords

graph drawinggraph theoryHamiltonicityplanarityspine drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Graph Drawing
• Theoretical results on at most 1-bend embeddability of graphs
• Planar octilinear drawings with one bend per edge
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

Cites work

• Curve-constrained drawings of planar graphs
• Drawing Graphs on Two and Three Lines
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Graph Drawing
• Graph drawing software
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 1974105 (Why is no real title available?)
• scientific article; zbMATH DE number 1875438 (Why is no real title available?)
• Interval graphs and maps of DNA
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• The book thickness of a graph

Cited in

(1)

• Graph Drawing

This page was built for publication: \(k\)-spine, 1-bend planarity

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