Pages that link to "Item:Q5056168"
From MaRDI portal
The following pages link to On triangulating planar graphs under the four-connectivity constraint (Q5056168):
Displaying 15 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Embedding a triangular graph within a given boundary (Q654561) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q1386769) (← 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)
- 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)
- Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- (Q3347910) (← links)
- Construction of planar 4-connected triangulations (Q3465653) (← links)
- (Q3476850) (← links)
- Constructing a Family of 4‐Critical Planar Graphs with High Edge Density (Q5360886) (← links)
