The following pages link to P. Ossona de Mendez (Q175580):
Displaying 50 items.
- (Q251298) (redirect page) (← links)
- Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
- Structural limits and approximations of mappings (Q322317) (← links)
- Strongly polynomial sequences as interpretations (Q334158) (← links)
- (Q411844) (redirect page) (← links)
- Thue choosability of trees (Q411845) (← links)
- Sparsity. Graphs, structures, and algorithms (Q419416) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Trémaux trees and planarity (Q661936) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Transitivity and connectivity of permutations (Q705750) (← links)
- Decomposing a graph into forests (Q765188) (← links)
- Representations by contact and intersection of segments (Q879951) (← links)
- Barycentric systems and stretchability (Q885280) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← links)
- On a characterization of Gauss codes (Q1302047) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- A left-first search algorithm for planar graphs (Q1892422) (← links)
- Limits of structures and the example of tree semi-lattices (Q2012557) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- Clustering powers of sparse graphs (Q2209886) (← links)
- Regular partitions of gentle graphs (Q2216929) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Defective colouring of graphs excluding a subgraph or minor (Q2322507) (← links)
- Limits of mappings (Q2403694) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- A note on Fiedler value of classes with sublinear separators (Q2435377) (← links)
- Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) (← links)
- Folding (Q2498742) (← links)
- Planarity and edge poset dimension (Q2563526) (← links)
- Cuts and bounds (Q2575795) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- 1-subdivisions, the fractional chromatic number and the Hall ratio (Q2663411) (← links)
- Connectivity of planar graphs (Q2755060) (← links)
- Structural sparsity (Q2815673) (← links)
- Coding properties of breadth-first search orderings (Q2816129) (← links)
- Counting homomorphisms to sparse graphs (Q2851494) (← links)
- When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741) (← links)
- Linear time low tree-width partitions and algorithmic consequences (Q2931403) (← links)
- (Q3043707) (← links)
- (Q3078211) (← links)
- (Q3096706) (← links)
