At most single-bend embeddings of cubic graphs

DOI10.1007/BF02662066zbMath0808.05039OpenAlexW2054234829MaRDI QIDQ1335404

Yanpei Liu, Rossella Petreschi, Paola Marchioro

Publication date: 7 March 1995

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02662066

zbMATH Keywords

VLSI designcubic graphplanebendsingle-bend embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Drawing planar graphs using the canonical ordering ⋮ An efficient orthogonal grid drawing algorithm for cubic graphs ⋮ Variants of the segment number of a graph ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Grid straight-line embeddings of trees with a minimum number of bends per path ⋮ Some combinatorial optimization problems arising from VLSI circuit design ⋮ Boolean approaches to graph embeddings related to VLSI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• General theoretical results on rectilinear embeddability of graphs
• Theoretical results on at most 1-bend embeddability of graphs
• Planar graphs: Theory and algorithms
• Computing an st-numbering
• Algorithms for drawing graphs: An annotated bibliography

This page was built for publication: At most single-bend embeddings of cubic graphs