Pages that link to "Item:Q650938"
From MaRDI portal
The following pages link to Dominating set is fixed parameter tractable in claw-free graphs (Q650938):
Displaying 14 items.
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- (Q6065417) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
