Pages that link to "Item:Q2428671"

The following pages link to The \(k\)-in-a-path problem for claw-free graphs (Q2428671):

Displaying 14 items.

• Induced disjoint paths in AT-free graphs (Q2051862) (← links)
• Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
• Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
• Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
• Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
• FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
• (Q5111880) (← links)
• Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels (Q6080861) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)