Hankuk University of Foreign Studies

output

20022026

most citedCommunication and Control in Collaborative UAVs: Recent Advances and Future Trends

325 citations

Showing math.COShow all

19 papers · 1 filter

math.CO2022

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4

Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický

The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square $G^{2}$ of a planar graph $G$ , depending on the maximum degree $Δ (G)$ of…

math.CO2022★ 3 cited

Independent domination of graphs with bounded maximum degree

Eun-Kyung Cho, Jinha Kim, Minki Kim +1

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to s…

math.CO2021★ 10 cited

Tight bound for independent domination of cubic graphs without $4$ -cycles

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2021

On independent domination of regular graphs

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2021

Brick partition problems in three dimensions

Ilkyoo Choi, Minseong Kim, Kiwon Seo

A $d$ -dimensional brick is a set $I_{1} \times \dots \times I_{d}$ where each $I_{i}$ is an interval. Given a brick $B$ , a brick partition of $B$ is a partition of $B$ into bricks. A bri…

math.CO2020★ 1 cited

The strong clique number of graphs with forbidden cycles

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +1

Given a graph $G$ , the strong clique number of $G$ , denoted $ω_{S} (G)$ , is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the…