Byeong Moon Kim

According to our database1, Byeong Moon Kim authored at least 17 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Two-color Rado number of <i>x</i> + <i>y</i> + <i>c</i> = <i>kz</i> for large <i>c</i>.
Discret. Math., December, 2023

2022
Two-color Rado number of <i>x</i> + <i>y</i> + <i>c</i> = <i>kz</i> for odd <i>c</i> and <i>k</i> with <i>k</i> ≥ <i>c</i> + 6.
Discret. Math., 2022

2021
The Lower and Upper Bounds of Turán Number for Odd Wheels.
Graphs Comb., 2021

2018
Distance two labellings for 8-regular grid.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

2017
Lambda number for the direct product of some family of graphs.
J. Comb. Optim., 2017

Distance multi-labelling of graphs with weighted vertices.
IET Commun., 2017

2015
L(1, 1)-labelling of the direct product of a complete graph and a cycle.
J. Comb. Optim., 2015

Radio number for the product of a path and a complete graph.
J. Comb. Optim., 2015

<i>L</i>(<i>h</i>, <i>k</i>)-labelling for octagonal grid.
Int. J. Comput. Math., 2015

2-distance colorings of some direct products of paths and cycles.
Discret. Math., 2015

2013
<i>L</i>(2, 1)-labellings for direct products of a triangle and a cycle.
Int. J. Comput. Math., 2013

Distance three labellings for <i>K</i> <sub> <i>n</i> </sub>×<i>K</i> <sub>2</sub>.
Int. J. Comput. Math., 2013

2012
Van der Waerden's Theorem on Homothetic Copies of {1, 1+s, 1+s+t}.
Integers, 2012

The maximum radius of graphs with given order and minimum degree.
Discret. Math., 2012

2010
The fifteen theorem for universal Hermitian lattices over imaginary quadratic fields.
Math. Comput., 2010

Corrigendum to "The exponent of Cartesian product of cycles" [Appl. Math. Lett 22 (2009) 561-564].
Appl. Math. Lett., 2010

2009
The exponent of Cartesian product of cycles.
Appl. Math. Lett., 2009


  Loading...