Pages that link to "Item:Q1923612"
From MaRDI portal
The following pages link to Finding regular subgraphs in both arbitrary and planar graphs (Q1923612):
Displaying 14 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Subgraphs of 4-regular planar graphs (Q644803) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- A note on the complexity of finding regular subgraphs (Q1059641) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Polynomial time algorithms for two classes of subgraph problem (Q3598037) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)