Theoretical results on at most 1-bend embeddability of graphs

DOI10.1007/BF02006154zbMath0781.05015OpenAlexW2003764821MaRDI QIDQ1210238

Paola Marchioro, Rossella Petreschi, Bruno Simeone, Yanpei Liu

Publication date: 25 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

upper boundscharacterizationsembeddingpolynomial time algorithmplanar graphbend\(k\)-rectilinear graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

At most single-bend embeddings of cubic graphs ⋮ On the net-embeddability of graphs ⋮ Orthogeodesic point-set embedding of trees ⋮ Drawing planar graphs using the canonical ordering ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Orthogonal graph drawing with flexibility constraints ⋮ Advances in the theory and practice of graph drawing ⋮ Some combinatorial optimization problems arising from VLSI circuit design ⋮ Boolean approaches to graph embeddings related to VLSI

Cites Work

• General theoretical results on rectilinear embeddability of graphs
• Single bend wiring
• Boolean approach to planar embeddings of a graph

This page was built for publication: Theoretical results on at most 1-bend embeddability of graphs