Pages that link to "Item:Q1322236"
From MaRDI portal
The following pages link to Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236):
Displaying 28 items.
- Contraction obstructions for connected graph searching (Q298950) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- Outerplanar obstructions for a feedback vertex set (Q412287) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Mixed searching and proper-path-width (Q674341) (← links)
- Connected graph searching (Q690489) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph (Q907257) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Outerplanar Obstructions for the Feedback Vertex Set (Q2851458) (← links)
- Obstructions for Tree-depth (Q2851471) (← links)
- (Q2857402) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- On Evasion Games on Graphs (Q2958109) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- On the pathwidth of hyperbolic 3-manifolds (Q5881542) (← links)
