The following pages link to Piotr Micek (Q377498):
Displaying 50 items.
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Triangle-free intersection graphs of line segments with large chromatic number (Q401487) (← links)
- Parity in graph sharing games (Q418883) (← links)
- An extremal problem on crossing vectors. (Q458279) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Pathwidth and nonrepetitive list coloring (Q504976) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Boolean dimension, components and blocks (Q781531) (← links)
- Tight bounds on the clique chromatic number (Q820840) (← links)
- Sparsity and dimension (Q1715074) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- On-line version of Rabinovitch theorem for proper intervals (Q1761461) (← links)
- On-line chain partitions of up-growing semi-orders (Q1943698) (← links)
- Excluding a ladder (Q2095109) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- How to eat 4/9 of a pizza (Q2275387) (← links)
- Nowhere dense graph classes and dimension (Q2288358) (← links)
- Separating tree-chromatic number from path-chromatic number (Q2312619) (← links)
- On-line dimension of semi-orders (Q2376894) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- Tree-width and dimension (Q2400108) (← links)
- On the dimension of posets with cover graphs of treewidth 2 (Q2407679) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Outerplanar graph drawings with few slopes (Q2444313) (← links)
- Boolean dimension and tree-width (Q2658384) (← links)
- Seymour's conjecture on 2-connected graphs of large pathwidth (Q2663412) (← links)
- Graph Drawings with One Bend and Few Slopes (Q2802968) (← links)
- A note on concurrent graph sharing games (Q2830435) (← links)
- (Q2851094) (← links)
- Lower Bounds for On-line Graph Colorings (Q2942655) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Making triangles colorful (Q2968105) (← links)
- (Q3575997) (← links)
- (Q3575999) (← links)
- Sparsity and dimension (Q4575709) (← links)
- Topological Minors of Cover Graphs and Dimension (Q4596316) (← links)
- Planar Posets Have Dimension at Most Linear in Their Height (Q4599767) (← links)
- New approach to nonrepetitive sequences (Q4909201) (← links)
- Adjacency Labelling for Planar Graphs (and Beyond) (Q5056430) (← links)
- Planar Graphs Have Bounded Queue-Number (Q5133977) (← links)
- Improved bounds for centered colorings (Q5146925) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- A Graph-Grabbing Game (Q5199511) (← links)
- Making Octants Colorful and Related Covering Decomposition Problems (Q5246096) (← links)
- Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision (Q5272631) (← links)
- Nonrepetitive Choice Number of Trees (Q5300504) (← links)
- On-line coloring between two lines (Q5368717) (← links)
- Making Octants Colorful and Related Covering Decomposition Problems (Q5384067) (← links)
- (Q5419981) (← links)
