Ho‐Jin Choi

most cited

(1, k)

-coloring of graphs with girth at least

5

on a surface

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CV2024

Intriguing Properties of Large Language and Vision Models

Young-Jun Lee, Byungsoo Ko, Han-Gyu Kim +2

Recently, large language and vision models (LLVMs) have received significant attention and development efforts due to their remarkable generalization performance across a wide rang…

math.CO2014★ 2 cited

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

A graph is $(d_{1}, ..., d_{r})$ -colorable if its vertex set can be partitioned into $r$ sets $V_{1}, ..., V_{r}$ so that the maximum degree of the graph induced by $V_{i}$ is at most $d_{i}$ …

Intriguing Properties of Large Language and Vision Models

(1,k)-coloring of graphs with girth at least 5 on a surface

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface