The following pages link to (Q5009589):
Displaying 10 items.
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- (Q5089162) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Recognition and isomorphism of proper \(H \)-graphs for unicyclic \(H\) in \textit{FPT}-time (Q6575404) (← links)
