The following pages link to Przemysław Gordinowicz (Q385385):
Displaying 21 items.
- On automorphisms of the countable p.e.c. graph (Q385386) (← links)
- Planar graph is on fire (Q501009) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Centroidal localization game (Q668034) (← links)
- Dense free subgroups of automorphism groups of homogeneous partially ordered sets (Q670969) (← links)
- Quick max-flow algorithm (Q841606) (← links)
- On graphs isomorphic to their neighbour and non-neighbour sets (Q976164) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- Cops and robbers playing on edges (Q2448255) (← links)
- Brushing without capacity restrictions (Q2449081) (← links)
- The first player wins the one-colour triangle avoidance game on 16 vertices (Q2906377) (← links)
- (Q3012580) (← links)
- (Q3120651) (← links)
- Cops and Robbers on String Graphs (Q3459875) (← links)
- The 2‐surviving rate of planar graphs with average degree lower than (Q4646940) (← links)
- The polynomial method for list-colouring extendability of outerplanar graphs (Q5020296) (← links)
- (Q5265408) (← links)
- Erratum: The 2‐surviving rate of planar graphs with average degree lower than 92 (Q6080860) (← links)
