Pages that link to "Item:Q3361904"

The following pages link to Easy problems for tree-decomposable graphs (Q3361904):

Displaying 9 items.

• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
• A comparison of structural CSP decomposition methods (Q1589639) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
• A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
• Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)