Boram Park

activity

20092023

most citedThe competition numbers of ternary Hamming graphs

14 citations · 118 across the 38 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015★ 1 cited

On the safe set of Cartesian product of two complete graphs

Bumtle Kang, Suh-Ryung Kim, Boram Park

For a connected graph $G$ , a vertex subset $S$ of $V (G)$ is a safe set if for every component $C$ of the subgraph of $G$ induced by $S$ , $∣ C ∣ \geq ∣ D ∣$ holds for every component $D$ …

math.CO2015★ 1 cited

Coloring the squares of graphs whose maximum average degrees are less than 4

Seog-Jin Kim, Boram Park

The square $G^{2}$ of a graph $G$ is the graph defined on $V (G)$ such that two vertices $u$ and $v$ are adjacent in $G^{2}$ if the distance between $u$ and $v$ in $G$ is at most 2. The…

math.AT2015

Pseudograph and its associated real toric manifold

Suyoung Choi, Boram Park, Seonjeong Park

Given a simple graph $G$ , the graph associahedron $P_{G}$ is a convex polytope whose facets correspond to the connected induced subgraphs of $G$ . Graph associahedra have been studied…