The following pages link to Quickly excluding a forest (Q1179478):
Displaying 50 items.
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- \textsc{max-cut} and containment relations in graphs (Q441861) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Submodular partition functions (Q1045090) (← links)
- Excluding infinite minors (Q1191928) (← links)
- Upper bounds on the size of obstructions and intertwines (Q1272647) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Directed tree-width (Q1850539) (← links)
- Tree-width and planar minors (Q2259855) (← links)
- Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
- Directed path-width and monotonicity in digraph searching (Q2502026) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- The mixed search game against an agile and visible fugitive is monotone (Q2685344) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract) (Q2945175) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Tangle and Maximal Ideal (Q2980900) (← links)
- max-cut and Containment Relations in Graphs (Q3057609) (← links)
- Excluding Subdivisions of Infinite Cliques (Q4018433) (← links)
- Excluding Infinite Trees (Q4038489) (← links)
- On the Block Number of Graphs (Q4623134) (← links)
- The size of an intertwine (Q4632453) (← links)
- Graph Minors I: A Short Proof of the Path-width Theorem (Q4844487) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem (Q5100142) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Circumference and Pathwidth of Highly Connected Graphs (Q5265331) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
