The following pages link to On tree-partitions of graphs (Q1910567):
Displayed 11 items.
- On tree-partition-width (Q1024321) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← 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)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)