Boram Park

1. Brooks-type theorems for relaxations of square colorings
   2023/02/13 by Eun‐Kyung Cho, Cho, Eun-Kyung, Ilkyoo Choi +5 · 5 citations
   Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research
2. Proper conflict-free coloring of sparse graphs
   2022/03/30 by Eun‐Kyung Cho, Ilkyoo Choi, Cho, Eun-Kyung +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Optimization and Search Problems #Computational Geometry and Mesh Generation
3. List 3-dynamic coloring of graphs with small maximum average degree
   2016/09/19 by Seog‐Jin Kim, Boram Park, Kim, Seog-Jin +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research
4. Strong odd coloring of sparse graphs
   2024/01/22 by Hyemin Kwon, Kwon, Hyemin, Boram Park +1 · 2 citations
   Computer Science · Neuroscience · Mathematics · #05C15 #Combinatorics (math.CO) #FOS: Mathematics
5. Minimum degree conditions for removable matchings in k-connected graphs
   2026/07/20 by Hojin Chu, Ringi Kim, Boram Park
   #math.CO
6. Towards a strengthening of the second neighborhood conjecture
   2026/07/20 by Yandong Bai, Binlong Li, Boram Park
   #math.CO