At most single-bend embeddings of cubic graphs
DOI10.1007/BF02662066zbMATH Open0808.05039OpenAlexW2054234829MaRDI QIDQ1335404FDOQ1335404
Authors: Yanpei Liu, Paola Marchioro, Rossella Petreschi 
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- Algorithms for drawing graphs: An annotated bibliography
- Title not available (Why is that?)
- General theoretical results on rectilinear embeddability of graphs
- Title not available (Why is that?)
- Computing an st-numbering
- Title not available (Why is that?)
- Planar graphs: Theory and algorithms
- Theoretical results on at most 1-bend embeddability of graphs
Cited In (8)
- Boolean approaches to graph embeddings related to VLSI
- Some combinatorial optimization problems arising from VLSI circuit design
- Grid straight-line embeddings of trees with a minimum number of bends per path
- Drawing planar graphs using the canonical ordering
- Theoretical results on at most 1-bend embeddability of graphs
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- An efficient orthogonal grid drawing algorithm for cubic graphs
- Variants of the segment number of a graph
This page was built for publication: At most single-bend embeddings of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335404)
