Pages that link to "Item:Q2333800"

The following pages link to Mim-width. III. Graph powers and generalized distance domination problems (Q2333800):

Displaying 20 items.

• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• (Q5009468) (← links)
• (Q5111880) (← 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 (Q6056798) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
• Recognizing Proper Tree-Graphs (Q6089652) (← links)
• The statistical analysis for Sombor indices in a random polygonal chain networks (Q6110612) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)