Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
From MaRDI portal
Publication:1392021
DOI10.1016/S0304-3975(95)00257-XzbMath0903.68137OpenAlexW1964716955MaRDI QIDQ1392021
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(95)00257-x
Related Items (52)
Visibility representations of four-connected plane graphs with near optimal heights ⋮ Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Simultaneous visibility representations of plane \(st\)-graphs using L-shapes ⋮ Orientation-Constrained Rectangular Layouts ⋮ Aspect ratio universal rectangular layouts ⋮ Rectilinear Duals Using Monotone Staircase Polygons ⋮ On rectangular cartograms ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Rectangular grid drawings of plane graphs ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ Constrained floorplans in 2D and 3D ⋮ Morphing rectangular duals ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ Good spanning trees in graph drawing ⋮ On the enumeration of plane bipolar posets and transversal structures ⋮ An annotated review on graph drawing and its applications ⋮ Combinatorial generation via permutation languages. III: Rectangulations ⋮ Bitonic st-orderings for Upward Planar Graphs ⋮ Optimal polygonal representation of planar graphs ⋮ Bijections for Baxter families and related objects ⋮ Extending partial representations of rectangular duals with given contact orientations ⋮ 4-connected triangulations on few lines ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Unnamed Item ⋮ Imbalance is fixed parameter tractable ⋮ A bijection for essentially 4-connected toroidal triangulations ⋮ OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Improved visibility representation of plane graphs ⋮ Closed rectangle-of-influence drawings for irreducible triangulations ⋮ CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS ⋮ Balanced vertex-orderings of graphs ⋮ Clean the graph before you draw it! ⋮ The partial visibility representation extension problem ⋮ A transformation algorithm to construct a rectangular floorplan ⋮ Rectangular drawings of plane graphs without designated corners ⋮ A bijection for essentially 3-connected toroidal maps ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ Imbalance parameterized by twin cover revisited ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ Transversal structures on triangulations: A combinatorial study and straight-line drawings ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ Open rectangle-of-influence drawings of inner triangulated plane graphs ⋮ Simultaneous Visibility Representations of Plane st-graphs Using L-shapes ⋮ Optimal \(st\)-orientations for plane triangulations ⋮ ON OPEN RECTANGLE-OF-INFLUENCE AND RECTANGULAR DUAL DRAWINGS OF PLANE GRAPHS ⋮ CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING ⋮ Bijective counting of plane bipolar orientations and Schnyder woods ⋮ New bijective links on planar maps via orientations ⋮ Visibility representation of plane graphs via canonical ordering tree ⋮ A theory of L-shaped floor-plans
Cites Work
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- A theory of rectangular dual graphs
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- A linear algorithm to find a rectangular dual of a planar triangulated graph
- Planar graphs and poset dimension
- Algorithms for drawing graphs: An annotated bibliography
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Arboricity and Subgraph Listing Algorithms
- Rectangular duals of planar graphs
- A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph
- Efficient Planarity Testing
- Optimal Parallel 5-Colouring of Planar Graphs
- On Finding the Rectangular Duals of Planar Triangular Graphs
This page was built for publication: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
