Boram Park

According to our database1, Boram Park authored at least 35 papers between 2009 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Ramsey-type theorem for the matching number regarding connected graphs.
Discret. Math., 2020

Collapsibility of Non-Cover Complexes of Graphs.
Electron. J. Comb., 2020

2019
On the weighted safe set problem on paths and cycles.
J. Comb. Optim., 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb., 2019

On incidence choosability of cubic graphs.
Discret. Math., 2019

Characterization of forbidden subgraphs for bounded star chromatic number.
Discret. Math., 2019

2018
Cycles with two blocks in k-chromatic digraphs.
Journal of Graph Theory, 2018

List 3-dynamic coloring of graphs with small maximum average degree.
Discret. Math., 2018

On safe sets of the Cartesian product of two complete graphs.
Ars Comb., 2018

2017
A graph theoretic approach to the slot allocation problem.
Soc. Choice Welf., 2017

Shellable posets arising from the even subgraphs of a graph.
Electron. Notes Discret. Math., 2017

2016
Coloring of the Square of Kneser Graph K(2k+r, k).
Graphs Comb., 2016

Coloring the square of graphs whose maximum average degree is less than 4.
Discret. Math., 2016

The competition graphs of oriented complete bipartite graphs.
Discret. Appl. Math., 2016

2015
Counterexamples to the List Square Coloring Conjecture.
Journal of Graph Theory, 2015

A generalization of Opsut's result on the competition numbers of line graphs.
Discret. Appl. Math., 2015

Chromatic-choosability of the power of graphs.
Discret. Appl. Math., 2015

Bipartite Graphs whose Squares are not Chromatic-Choosable.
Electron. J. Comb., 2015

2014
Improved bounds on the chromatic numbers of the square of Kneser graphs.
Discret. Math., 2014

The competition hypergraphs of doubly partial orders.
Discret. Appl. Math., 2014

2013
On the cores of games arising from integer edge covering functions of graphs.
J. Comb. Optim., 2013

The phylogeny graphs of double partial orders.
Discuss. Math. Graph Theory, 2013

The competition number of the complement of a cycle.
Discret. Appl. Math., 2013

The impact of influential leaders in the formation and development of social networks.
Proceedings of the International Conference on Communities and Technologies 2013, 2013

2012
Population solidarity, population fair-ranking, and the egalitarian value.
Int. J. Game Theory, 2012

The competition number of a generalized line graph is at most two.
Discret. Math. Theor. Comput. Sci., 2012

On Opsut's conjecture for hypercompetition numbers of hypergraphs.
Discret. Appl. Math., 2012

The competition numbers of complete multipartite graphs with many partite sets.
Discret. Appl. Math., 2012

A Dice Rolling Game on a Set of Tori.
Electron. J. Comb., 2012

The competition number of a graph and the dimension of its hole space.
Appl. Math. Lett., 2012

2011
On the hypercompetition numbers of hypergraphs.
Ars Comb., 2011

The competition numbers of ternary Hamming graphs.
Appl. Math. Lett., 2011

The m-step competition graphs of doubly partial orders.
Appl. Math. Lett., 2011

2010
The competition numbers of Johnson graphs.
Discuss. Math. Graph Theory, 2010

2009
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.
Discret. Math., 2009


  Loading...