The following pages link to Suh-Ryung Kim (Q209045):
Displaying 50 items.
- On the competition graphs of \(d\)-partial orders (Q266800) (← links)
- On the cores of games arising from integer edge covering functions of graphs (Q386434) (← links)
- The competition numbers of complete multipartite graphs with many partite sets (Q423931) (← links)
- A dice rolling game on a set of tori (Q426826) (← links)
- The competition number of a graph and the dimension of its hole space (Q427694) (← links)
- A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
- On consecutive edge magic total labelings of connected bipartite graphs (Q512862) (← links)
- Graphs having many holes but with small competition numbers (Q540279) (← links)
- (Q689959) (redirect page) (← links)
- \(p\)-competition numbers (Q689960) (← links)
- On Opsut's conjecture for hypercompetition numbers of hypergraphs (Q713325) (← links)
- On the possible scientific laws (Q809027) (← links)
- On CCE graphs of doubly partial orders (Q881574) (← links)
- The competition graphs of oriented complete bipartite graphs (Q908307) (← links)
- The competition number of a graph whose holes do not overlap much (Q987698) (← links)
- The competition numbers of complete tripartite graphs (Q1003747) (← links)
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares (Q1045184) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- Competition numbers of graphs with a small number of triangles (Q1377663) (← links)
- Factorizations of matrices over semirings. (Q1414145) (← links)
- The \(m\)-step competition graph of a digraph (Q1582072) (← links)
- Graphs satisfying inequality \(\theta(G^2) \leq \theta(G)\) (Q1613456) (← links)
- Domination graphs of regular tournaments (Q1613487) (← links)
- The partial order competition dimensions of bipartite graphs (Q1720310) (← links)
- A graph with the partial order competition dimension greater than five (Q1741519) (← links)
- On the partial order competition dimensions of chordal graphs (Q1786874) (← links)
- New \(q\)-Laguerre polynomials having factorized permutation interpretations (Q1799762) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Graph equation for line graphs and \(m\)-step graphs (Q1928288) (← links)
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
- On chordal phylogeny graphs (Q2043361) (← links)
- Competitively orientable complete multipartite graphs (Q2144500) (← links)
- Structural properties of Toeplitz graphs (Q2166273) (← links)
- The niche graphs of bipartite tournaments (Q2185734) (← links)
- On \(m\)-step competition graphs of bipartite tournaments (Q2192078) (← links)
- Counting independent sets in Riordan graphs (Q2198385) (← links)
- On the minimum clique partitioning problem on weighted chordal graphs (Q2272395) (← links)
- On \((1, 2)\)-step competition graphs of bipartite tournaments (Q2410227) (← links)
- On the phylogeny graphs of degree-bounded digraphs (Q2410253) (← links)
- The \(m\)-step competition graphs of doubly partial orders (Q2430029) (← links)
- Competitively tight graphs (Q2441380) (← links)
- The competition number of the complement of a cycle (Q2446303) (← links)
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected (Q2448228) (← links)
- The competition hypergraphs of doubly partial orders (Q2448902) (← links)
- A class of acyclic digraphs with interval competition graphs (Q2486750) (← links)
- On the graph inequality \(\theta _{E}(G)\geqslant \theta _{E}(G^{m})\) (Q2495511) (← links)
- The competition number of a graph having exactly one hole (Q2576849) (← links)
- The elimination procedure for the competition number (Q2713639) (← links)
- Two families of graphs that are not CCE-orientable. (Q2715996) (← links)
- On the inequality \(dk(G)\leq k(G)+1\) (Q2761055) (← links)
