- Graphs with full rank 3-color matrix and few 3-colorings2008 | Faculty of Mathematics and Physics
- On 3-Coloring of (2P_4, C_5)-Free Graphs2022 | Faculty of Mathematics and Physics
- Do Triangle-Free Planar Graphs have Exponentially Many 3-Colorings?2017 | Faculty of Mathematics and Physics
- 3-Coloring C4 or C3 -Free Diameter Two Graphs2023 | Faculty of Mathematics and Physics
- On 3-Coloring of (2P4, C5)-Free Graphs2021 | Faculty of Mathematics and Physics
- Sub-exponentially many 3-colorings of triangle-free planar graphs2013 | Faculty of Mathematics and Physics
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 8-Cycle2015 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations2024 | Faculty of Mathematics and Physics
- FINE STRUCTURE OF 4-CRITICAL TRIANGLE-FREE GRAPHS I. PLANAR GRAPHS WITH TWO TRIANGLES AND 3-COLORABILITY OF CHAINS2018 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk2018 | Faculty of Mathematics and Physics
- FINE STRUCTURE OF 4-CRITICAL TRIANGLE-FREE GRAPHS II. PLANAR TRIANGLE-FREE GRAPHS WITH TWO PRECOLORED 4-CYCLES2017 | Faculty of Mathematics and Physics
- Characterization of 4-critical triangle-free toroidal graphs2022 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle2016 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm2022 | Faculty of Mathematics and Physics
- Three-coloring triangle-free planar graphs in linear time2011 | Faculty of Mathematics and Physics
- Coloring triangle-free graphs on surfaces +12009 | Faculty of Mathematics and Physics
- Triangle-free planar graphs with at most 64n(0.731 3)-colorings2022 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies2021 | Faculty of Mathematics and Physics
- FINE STRUCTURE OF 4-CRITICAL TRIANGLE-FREE GRAPHS III. GENERAL SURFACES2018 | Faculty of Mathematics and Physics
- 3-choosability of planar graphs with ({= 4)-cycles far apart2014 | Faculty of Mathematics and Physics
- Planar 4-critical graphs with four triangles2014 | Faculty of Mathematics and Physics
- Coloring near-quadrangulations of the cylinder and the torus2021 | Faculty of Mathematics and Physics
- Exponentially Many Nowhere-Zero Z_3, Z_4 and Z_6-Flows2019 | Faculty of Mathematics and Physics
- Exponentially many nowhere-zero Z3-, Z4-, and Z6-flows2017 | Faculty of Mathematics and Physics
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult2006 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs2021 | Faculty of Mathematics and Physics
- Covering minimal separators and potential maximal cliques in P-t-free graphs2021 | Faculty of Mathematics and Physics
- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps2019 | Faculty of Mathematics and Physics
- Symetric Promise Constraint Satisfaction Problems: Beyond The Boolean Case2021 | Faculty of Mathematics and Physics