Skip to main content

and
  1. No Access

    Article

    The Lower and Upper Bounds of Turán Number for Odd Wheels

    The Turán number for a graph H, denoted by \(\text {ex}(n,H)\) ex

    Byeong Moon Kim, Byung Chul Song, Woonjae Hwang in Graphs and Combinatorics (2021)

  2. No Access

    Article

    Lambda number for the direct product of some family of graphs

    An L(2, 1)-labeling for a graph \(G=(V,E)\) G ...

    Byeong Moon Kim, Yoomi Rho, Byung Chul Song in Journal of Combinatorial Optimization (2017)

  3. No Access

    Article

    \(L(1,1)\) -labelling of the direct product of a complete graph and a cycle

    An \(L(j,k)\) L ( ...

    Byeong Moon Kim, Yoomi Rho, Byung Chul Song in Journal of Combinatorial Optimization (2015)

  4. No Access

    Article

    Radio number for the product of a path and a complete graph

    A multilevel distance labeling of a graph \(G=(V,E)\) ...

    Byeong Moon Kim, Woonjae Hwang, Byung Chul Song in Journal of Combinatorial Optimization (2015)

  5. No Access

    Article

    Minimum orders of eulerian oriented digraphs with given diameter

    A digraph D is oriented if it does not contain 2-cycles. If an oriented digraph D has a directed eulerian path, it is an oriented eulerian digraph. In this paper, when an oriented eulerian digraph D has minimum o...

    Yoomi Rho, Byeong Moon Kim, Woonjae Hwang in Acta Mathematica Sinica, English Series (2014)