Pages that link to "Item:Q5002822"
From MaRDI portal
The following pages link to Reducing CMSO model checking to highly connected graphs (Q5002822):
Displayed 9 items.
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)