The following pages link to Domination When the Stars Are Out (Q3012826):
Displaying 21 items.
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- (Q4972667) (redirect page) (← links)
- (Q5009627) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
