Pages that link to "Item:Q1910589"
From MaRDI portal
The following pages link to The sizes of maximal planar, outerplanar, and bipartite planar subgraphs (Q1910589):
Displayed 7 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Finding Triangles for Maximum Planar Subgraphs (Q2980925) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- Coloring the square of maximal Planar graphs with diameter two (Q6048644) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)