The following pages link to Piotr Micek (Q377498):
Displayed 18 items.
- Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
- Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5915813) (← links)
- Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5970276) (← links)
- Treedepth vs circumference (Q6081390) (← links)
- Colouring bottomless rectangles and arborescences (Q6110074) (← links)
- Reconfiguring Independent Sets on Interval Graphs (Q6168437) (← links)
- Dimension is polynomial in height for posets with planar cover graphs (Q6187346) (← links)
- Note on the number of edges in families with linear union-complexity (Q6247058) (← links)
- Planar cubic graphs of small diameter (Q6323693) (← links)
- Excluding a ladder (Q6333994) (← links)
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets (Q6338767) (← links)
- Tight Bounds on the Clique Chromatic Number (Q6343313) (← links)
- Boolean dimension and dim-boundedness: Planar cover graph with a zero (Q6402072) (← links)
- Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure (Q6419593) (← links)
- Tight bound on treedepth in terms of pathwidth and longest path (Q6425608) (← links)
- The grid-minor theorem revisited (Q6442800) (← links)
- Boolean dimension of a Boolean lattice (Q6445728) (← links)
- Cliquewidth and dimension (Q6448343) (← links)