Pages that link to "Item:Q1386769"
From MaRDI portal
The following pages link to On triangulating planar graphs under the four-connectivity constraint (Q1386769):
Displaying 30 items.
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Embedding a triangular graph within a given boundary (Q654561) (← links)
- Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Transversal structures on triangulations: A combinatorial study and straight-line drawings (Q1011766) (← links)
- Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected (Q1569851) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Packing and covering triangles in \(K_{4}\)-free planar graphs (Q1926019) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Four-connected triangulations of planar point sets (Q2351013) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- Connectivity of planar graphs (Q2755060) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Non-aligned Drawings of Planar Graphs (Q2961510) (← links)
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS (Q2999095) (← links)
- (Q3347910) (← links)
- Construction of planar 4-connected triangulations (Q3465653) (← links)
- (Q3476850) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- (Q5075803) (← links)
- Constructing a Family of 4‐Critical Planar Graphs with High Edge Density (Q5360886) (← links)
- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections (Q5458852) (← links)
- (Q6150890) (← links)
- Universal geometric graphs (Q6632774) (← links)
