The following pages link to On low tree-depth decompositions (Q897253):
Displaying 17 items.
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Exact distance graphs of product graphs (Q2287747) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Injective coloring of graphs revisited (Q2689514) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- (Q5075772) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes (Q6135763) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
