Pages that link to "Item:Q287003"
From MaRDI portal
The following pages link to Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003):
Displaying 5 items.
- \(\mathcal{P}\)-apex graphs (Q1708380) (← links)
- Some vertex/edge-degree-based topological indices of \(r\)-apex trees (Q2051642) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
