The following pages link to Bartłomiej Bosek (Q251889):
Displaying 37 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- Centroidal localization game (Q668034) (← links)
- Additive coloring of planar graphs (Q742621) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Graph coloring and Graham's greatest common divisor problem (Q1690244) (← links)
- Majority coloring game (Q1727720) (← links)
- Generalized arboricity of graphs with large girth (Q1732768) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- On-line version of Rabinovitch theorem for proper intervals (Q1761461) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Graph polynomials and group coloring of graphs (Q2122688) (← links)
- Local dimension is unbounded for planar posets (Q2213803) (← links)
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- Hat chromatic number of graphs (Q2231730) (← links)
- On-line dimension of semi-orders (Q2376894) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- Majority choosability of digraphs (Q2409821) (← links)
- Planar posets that are accessible from below have dimension at most 6 (Q2663166) (← links)
- Shortest Augmenting Paths for Online Matchings on Trees (Q2788991) (← links)
- Variants of online chain partition problem of posets (Q2851094) (← links)
- Forbidden structures for efficient first-fit chain partitioning (extended abstract) (Q2857340) (← links)
- News about Semiantichains and Unichain Coverings (Q2907485) (← links)
- First-Fit Algorithm for the On-Line Chain Partitioning Problem (Q3058541) (← links)
- (Q3575997) (← links)
- Weight choosability of oriented hypergraphs (Q5225027) (← links)
- Harmonious coloring of uniform hypergraphs (Q5279870) (← links)
- First-Fit Coloring of Incomparability Graphs (Q5300485) (← links)
- A tight bound for shortest augmenting paths on trees (Q5919409) (← links)
- On the duality of semiantichains and unichain coverings. (Q5965139) (← links)
- (Q6059176) (← links)
- On a problem of Steinhaus (Q6179393) (← links)
- Majority choosability of countable graphs (Q6181996) (← links)
- Majority coloring of infinite digraphs (Q6621148) (← links)
- A Note About Majority Colorings of Countable DAGs (Q6731624) (← links)
- Alon-Tarsi for hypergraphs (Q6760503) (← links)
