Pages that link to "Item:Q5495799"
From MaRDI portal
The following pages link to Large-treewidth graph decompositions and applications (Q5495799):
Displayed 19 items.
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Polynomial expansion and sublinear separators (Q1686248) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Constant Congestion Brambles in Directed Graphs (Q5071097) (← links)
- (Q5075819) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)