The following pages link to Bartosz Walczak (Q324374):
Displaying 47 items.
- Asymmetric coloring games on incomparability graphs (Q324375) (← links)
- Minors and dimension (Q345115) (← links)
- 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)
- On the Beer index of convexity and its variants (Q512263) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs (Q904085) (← links)
- A simple representation of subwords of the Fibonacci word (Q1675765) (← links)
- Extending partial representations of trapezoid graphs (Q1687934) (← links)
- Boolean dimension and local dimension (Q1690054) (← links)
- Dimension of posets with planar cover graphs excluding two long incomparable chains (Q1734698) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
- Triangle-free geometric intersection graphs with no large independent sets (Q2256591) (← links)
- Tree-width and dimension (Q2400108) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Outerplanar graph drawings with few slopes (Q2444313) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Graph Drawings with One Bend and Few Slopes (Q2802968) (← links)
- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors (Q2864313) (← links)
- Extending Partial Representations of Function Graphs and Permutation Graphs (Q2912884) (← links)
- Coloring curves that cross a fixed curve (Q4580134) (← links)
- (Q4606269) (← links)
- Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace (Q4629982) (← links)
- Outerstring graphs are χ-bounded (Q4635536) (← links)
- Dimension and Cut Vertices: An Application of Ramsey Theory (Q4686099) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Planar graphs have bounded nonrepetitive chromatic number (Q5126756) (← links)
- A Graph-Grabbing Game (Q5199511) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5230348) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision (Q5272631) (← links)
- Minors and Dimension (Q5363058) (← links)
- Decomposition of Multiple Packings with Subquadratic Union Complexity (Q5364271) (← links)
- On the Beer Index of Convexity and Its Variants (Q5368702) (← links)
- (Q5419981) (← links)
- (Q5875557) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- Separating polynomial \(\chi\)-boundedness from \(\chi\)-boundedness (Q6126409) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- A solution to Ringel's circle problem (Q6385228) (← links)
- Tight bound on treedepth in terms of pathwidth and longest path (Q6425608) (← links)