General theoretical results on rectilinear embeddability of graphs
From MaRDI portal
Publication:809088
DOI10.1007/BF02006104zbMATH Open0732.05021MaRDI QIDQ809088FDOQ809088
Aurora Morgana, Bruno Simeone, Yanpei Liu
Publication date: 1991
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Recommendations
- Rectilinear Graphs and Their Embeddings
- Linear embeddings of graphs and graph limits
- On a conjecture of embeddable graphs
- On a straight-line embedding problem of graphs
- scientific article; zbMATH DE number 4012641
- scientific article
- Bounded Embeddings of Graphs in the Plane
- Theoretical results on at most 1-bend embeddability of graphs
- scientific article; zbMATH DE number 3968606
- Upper embeddability of graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)
Cites Work
Cited In (22)
- Rectilinear drawings of graphs
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Title not available (Why is that?)
- Boolean approaches to graph embeddings related to VLSI
- Embedding rectilinear graphs in linear time
- A graph theoretical approach to the firebreak locating problem
- Graphs of edge-intersecting and non-splitting paths
- Drawing graphs on rectangular grids
- At most single-bend embeddings of cubic graphs
- Advances in the theory and practice of graph drawing
- A better heuristic for orthogonal graph drawings
- Title not available (Why is that?)
- An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
- Single bend wiring on surfaces
- Theoretical results on at most 1-bend embeddability of graphs
- Generalizing the duality theorem of graph embeddings
- Rectilinear Graphs and Their Embeddings
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- A graph partition problem
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid
This page was built for publication: General theoretical results on rectilinear embeddability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809088)
