Myungho Choi

activity

20192026

most citedOn

(1, 2)

-step competition graphs of multipartite tournaments II

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

collaborators

7 papers

math.CO2026

$2$ -limited broadcast domination in cubic graphs

Myungho Choi, Boram Park

For a graph $G$ , a function $f : V (G) \to {0, 1, 2}$ is called a $2$ -limited dominating broadcast on $G$ if for every vertex $u$ , there exists a vertex $v$ such that $f (v) > 0$ and the…

math.CO2024

Multipartite tournaments in which any two vertices have an $(i, j)$ -step common out-neighbor

Myungho Choi, Suh-Ryung Kim

We say that a digraph $D$ is $(i, j)$ -step competitive if any two vertices have an $(i, j)$ -step common out-neighbor in $D$ and that a graph $G$ is $(i, j)$ -step competitively orienta…

math.CO2024

Competition-common enemy graphs of degree-bounded digraphs

Myungho Choi, Hojin Chu, Suh-Ryung Kim

The competition-common enemy graph (CCE graph) of a digraph $D$ is the graph with the vertex set $V (D)$ and an edge $uv$ if and only if $u$ and $v$ have a common predator and a com…

math.CO2024

Digraphs in which every $t$ vertices have exactly $λ$ common out-neighbors

Myungho Choi, Hojin Chu, Suh-Ryung Kim

We say that a digraph is a $(t, λ)$ -liking digraph if every $t$ vertices have exactly $λ$ common out-neighbors. In 1975, Plesník [Graphs with a homogeneity, 1975. {\it Glasnik Mathe…

math.CO2024

On $(1, 2)$ -step competition graphs of multipartite tournaments

Myungho Choi, Suh-Ryung Kim

A multipartite tournament is an orientation of a complete $k$ -partite graph for some positive integer $k \geq 3$ . We say that a multipartite tournament $D$ is tight if every partite…

math.CO2024★ 1 cited

On $(1, 2)$ -step competition graphs of multipartite tournaments II

Myungho Choi, Suh-Ryung Kim

A multipartite tournament is an orientation of a complete $k$ -partite graph for some positive integer $k \geq 3$ . We say that a multipartite tournament $D$ is tight if every partite…

2-limited broadcast domination in cubic graphs

Multipartite tournaments in which any two vertices have an (i,j)-step common out-neighbor

Competition-common enemy graphs of degree-bounded digraphs

Digraphs in which every t vertices have exactly λ common out-neighbors

On (1,2)-step competition graphs of multipartite tournaments

On (1,2)-step competition graphs of multipartite tournaments II

$2$ -limited broadcast domination in cubic graphs

Multipartite tournaments in which any two vertices have an $(i, j)$ -step common out-neighbor

Digraphs in which every $t$ vertices have exactly $λ$ common out-neighbors

On $(1, 2)$ -step competition graphs of multipartite tournaments

On $(1, 2)$ -step competition graphs of multipartite tournaments II