Pages that link to "Item:Q602681"

The following pages link to The \(k\)-in-a-tree problem for graphs of girth at least \(k\) (Q602681):

Displaying 11 items.

• The three-in-a-tree problem (Q653792) (← links)
• The four-in-a-tree problem in triangle-free graphs (Q844235) (← links)
• Induced disjoint paths in AT-free graphs (Q2051862) (← links)
• The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
• The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
• FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
• Constructing Trees in Graphs whose Complement has no <b><i>K</i></b>_{2,<b><i>s</i></b>} (Q3146982) (← links)
• Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)
• Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)