Pages that link to "Item:Q1272647"

The following pages link to Upper bounds on the size of obstructions and intertwines (Q1272647):

Displaying 27 items.

• Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
• Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
• Treewidth distance on phylogenetic trees (Q1637220) (← links)
• Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
• A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
• Computing the branchwidth of interval graphs (Q1764810) (← links)
• A Menger-like property of tree-cut width (Q1998754) (← links)
• Minor obstructions for apex-pseudoforests (Q2043398) (← links)
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
• Sparse obstructions for minor-covering parameters (Q2174553) (← links)
• Linear rank-width and linear clique-width of trees (Q2346380) (← links)
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• UPPER BOUNDS ON LINKING NUMBERS OF THICK LINKS (Q4541087) (← links)
• Some Characterization Results on Dynamic Cumulative Past Inaccuracy Measure (Q4623226) (← links)
• (Q5028484) (← links)
• Computing Tree Decompositions (Q5042458) (← links)
• A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
• Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
• Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
• Connected search for a lazy robber (Q6080862) (← links)
• Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)