Planar bus graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 739017 (Why is no real title available?)
- scientific article; zbMATH DE number 1142305 (Why is no real title available?)
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- A left-first search algorithm for planar graphs
- A unified approach to visibility representations of planar graphs
- Binary labelings for plane quadrangulations and their relatives
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Drawing graphs. Methods and models
- Efficient algorithms for Petersen's matching theorem
- Improved Circular Layouts
- Maximum matchings in planar graphs via Gaussian elimination
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On Steiner’s Problem with Rectilinear Distance
- On grid intersection graphs
- On the Core of a Graph†
- On topological aspects of orientations
- On-line maintenance of triconnected components with SPQR-trees
- Planar Lombardi Drawings for Subcubic Graphs
- Rectangle and Square Representations of Planar Graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Subgraph induced planar connectivity augmentation (extended abstract)
- The Steiner tree problem
This page was built for publication: Planar bus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724233)