| Colouring graphs with forbidden bipartite subgraphs J Anderson, A Bernshteyn, A Dhawan Combinatorics, Probability and Computing 32 (1), 45-67, 2023 | 13 | 2023 |
| Coloring graphs with forbidden almost bipartite subgraphs J Anderson, A Bernshteyn, A Dhawan arXiv preprint arXiv:2203.07222, 2022 | 6 | 2022 |
| Coloring locally sparse graphs J Anderson, A Dhawan, A Kuchukova arXiv preprint arXiv:2402.19271, 2024 | 4 | 2024 |
| Non-planar glass polishing pad and method of manufacture B Muncy, J Anderson, SB Daskiewich, GJ Wasilczyk US Patent 9,440,326, 2016 | 3 | 2016 |
| The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs J Anderson, H Chau, EK Cho, N Crawford, SG Hartke, E Heath, ... arXiv preprint arXiv:2401.14590, 2024 | 2 | 2024 |
| Defective correspondence coloring of planar graphs J Anderson arXiv preprint arXiv:2411.15336, 2024 | | 2024 |
| Borel line graphs J Anderson, A Bernshteyn arXiv preprint arXiv:2310.07893, 2023 | | 2023 |
| Borel line graphs A Bernshteyn, J Anderson 2024 Fall Western Sectional Meeting, 0 | | |
| On odd colorings and proper conflict-free colorings of planar graphs with girth conditions O Henderschedt, J Anderson, H Chau, EK Cho, N Crawford, SG Hartke, ... 2025 Joint Mathematics Meetings (JMM 2025), 0 | | |
Anton BernshteynUniversity of California, Los Angeles在 math.ucla.edu 的电子邮件经过验证
