Pages that link to "Item:Q3503839"
From MaRDI portal
The following pages link to The Induced Disjoint Paths Problem (Q3503839):
Displaying 17 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded (Q2094868) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- (Q5111880) (← links)
- (Q5743379) (← links)
- (Q5743428) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Path partitions of phylogenetic networks (Q6652450) (← links)
