2 citations · 3 across the 11 of their papers we have counts for
5 papers · 2 filters
On chordal phylogeny graphs
Soogang Eoh, Suh-Ryung Kim
An acyclic digraph each vertex of which has indegree at most and outdegree at most is called an digraph for some positive integers and . Lee {\it et al.} (2…
A new minimal chordal completion
Jihoon Choi, Soogang Eoh, Suh-Ryung Kim
In this paper, we present a minimal chordal completion of a graph satisfying the inequality for the non-chordality index of . In terms…
The niche graphs of bipartite tournaments
Soogang Eoh, Jihoon Choi, Suh-Ryung Kim +1
In this paper, we completely characterize the niche graphs of bipartite tournaments and find their interesting properties.
A graph with the partial order competition dimension greater than five
Jihoon Choi, Soogang Eoh, Suh-Ryung Kim
In this paper, we use the Erdös-Szekeres lemma to show that there exists a graph with partial order competition dimension greater than five.
The graph grabbing game on -weighted graphs
Soogang Eoh, Jihoon Choi
The \emph{graph grabbing game} is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the…