The following pages link to (Q4625695):
Displaying 23 items.
- The micro-world of cographs (Q831855) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- (Q5092394) (← links)
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Shrub-depth: Capturing Height of Dense Graphs (Q6288558) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
- Forbidden induced subgraphs and the Łoś-Tarski theorem (Q6545087) (← links)
- Transducing paths in graph classes with unbounded shrubdepth (Q6614398) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
