Pages that link to "Item:Q730002"
From MaRDI portal
The following pages link to Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002):
Displayed 6 items.
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
- (Q5002797) (← links)