Seog-Jin Kim

activity

20092026

most citedThe competition number of a graph with exactly two holes

8 citations · 50 across the 23 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

math.CO2010

Injective colorings of sparse graphs

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu

Let $ma d (G)$ denote the maximum average degree (over all subgraphs) of $G$ and let $χ_{i} (G)$ denote the injective chromatic number of $G$ . We prove that if $ma d (G) \leq 5/2$ , then $…

math.CO2010

Injective colorings of graphs with low average degree

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu

Let $\mad(G)$ denote the maximum average degree (over all subgraphs) of $G$ and let $χ_{i} (G)$ denote the injective chromatic number of $G$ . We prove that if $Δ \geq 4$ and $\mad(G)<\…