Boram Park

From MaRDI portal
Person:333479

Available identifiers

zbMath Open park.boramMaRDI QIDQ333479

List of research outcomes





PublicationDate of PublicationType
Proper conflict-free coloring of sparse graphs2025-01-06Paper
Monochromatic \(k\)-connection of graphs2024-12-04Paper
Brooks-type theorems for relaxations of square colorings2024-11-09Paper
Cohomology of a real toric variety and shellability of posets arising from a graph2023-12-22Paper
A tight bound for independent domination of cubic graphs without 4‐cycles2023-10-09Paper
On independent domination of regular graphs2023-10-09Paper
Decomposing planar graphs into graphs with degree restrictions2023-10-05Paper
The strong clique index of a graph with forbidden cycles2023-10-04Paper
Odd coloring of sparse graphs and planar graphs2023-03-10Paper
2-limited dominating broadcasts on cubic graphs without induced 4-cycles2023-01-11Paper
Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity2022-12-21Paper
Improvements on Hippchen's conjecture2022-08-24Paper
Proper conflict-free coloring of sparse graphs2022-03-30Paper
Odd coloring of sparse graphs and planar graphs2022-02-22Paper
Generalized list colouring of graphs2021-11-30Paper
The optimal proper connection number of a graph with given independence number2021-10-19Paper
On toric ideals arising from signed graphs2021-07-07Paper
On star 5-colorings of sparse graphs2021-03-17Paper
On induced saturation for paths2021-02-08Paper
Stable structure on safe set problems in vertex-weighted graphs2021-02-08Paper
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests2021-01-21Paper
Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice2020-10-20Paper
Graph invariants and Betti numbers of real toric manifolds2020-05-05Paper
Collapsibility of non-cover complexes of graphs2020-01-27Paper
A Ramsey-type theorem for the matching number regarding connected graphs2019-12-17Paper
Largest 2-regular subgraphs in 3-regular graphs2019-06-28Paper
On incidence choosability of cubic graphs2019-06-27Paper
On the weighted safe set problem on paths and cycles2019-06-06Paper
Characterization of forbidden subgraphs for bounded star chromatic number2019-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45586602018-11-29Paper
Cycles with two blocks in k‐chromatic digraphs2018-08-16Paper
List 3-dynamic coloring of graphs with small maximum average degree2018-04-05Paper
Shellable posets arising from the even subgraphs of a graph2018-01-18Paper
The Betti numbers of real toric varieties associated to Weyl chambers of type \(B\)2018-01-05Paper
A graph theoretic approach to the slot allocation problem2017-07-06Paper
Pseudograph and its associated real toric manifold2017-06-29Paper
On shellability for a poset of even subgraphs of a graph2017-05-18Paper
The airport problem with capacity constraints2016-11-11Paper
Consistency, population solidarity, and egalitarian solutions for TU-games2016-10-31Paper
Coloring of the square of Kneser graph \(K(2k+r,k)\)2016-07-28Paper
The competition graphs of oriented complete bipartite graphs2016-02-04Paper
Coloring the square of graphs whose maximum average degree is less than 42016-01-21Paper
On the safe set of Cartesian product of two complete graphs2015-08-11Paper
Counterexamples to the List Square Coloring Conjecture2015-03-24Paper
Bipartite graphs whose squares are not chromatic-choosable2015-03-11Paper
A generalization of Opsut's result on the competition numbers of line graphs2014-12-05Paper
Chromatic-choosability of the power of graphs2014-11-28Paper
The phylogeny graphs of double partial orders2014-07-30Paper
The competition hypergraphs of doubly partial orders2014-05-05Paper
The competition number of the complement of a cycle2014-04-16Paper
The competition number of a generalized line graph is at most two2014-03-25Paper
Competitively tight graphs2014-03-24Paper
Improved bounds on the chromatic numbers of the square of Kneser graphs2014-01-16Paper
On the cores of games arising from integer edge covering functions of graphs2013-12-09Paper
A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive2013-02-22Paper
On Opsut's conjecture for hypercompetition numbers of hypergraphs2012-10-26Paper
On the hypercompetition numbers of hypergraphs2012-10-12Paper
The competition number of a graph and the dimension of its hole space2012-06-14Paper
A dice rolling game on a set of tori2012-06-12Paper
The competition numbers of complete multipartite graphs with many partite sets2012-05-30Paper
Population solidarity, population fair-ranking, and the egalitarian value2012-05-16Paper
THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE2011-07-14Paper
The competition numbers of ternary Hamming graphs2011-06-28Paper
The competition numbers of Johnson graphs2011-05-09Paper
The \(m\)-step competition graphs of doubly partial orders2011-04-05Paper
The niche graphs of doubly partial orders2010-09-02Paper
Cycles and p-competition graphs2010-09-02Paper
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares2009-12-15Paper
Brooks-type theorems for relaxations of square coloringsN/APaper
Strong odd coloring of sparse graphsN/APaper
Monochromatic $k$-connection of graphsN/APaper

Research outcomes over time

This page was built for person: Boram Park