Boram Park

J. Graph Theory, May, 2023

Odd coloring of sparse graphs and planar graphs.

[BibT_eX]

[DOI]

Discret. Math., May, 2023

2-limited dominating broadcasts on cubic graphs without induced 4-cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

2022

Decomposing planar graphs into graphs with degree restrictions.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Improvements on Hippchen's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

The strong clique index of a graph with forbidden cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Generalized List Colouring of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

On induced saturation for paths.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Stable structure on safe set problems in vertex-weighted graphs.

[BibT_eX]

[DOI]

Shinya Fujita

Tadashi Sakuma

Eur. J. Comb., 2021

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests.

[BibT_eX]

[DOI]

Discret. Math., 2021

The optimal proper connection number of a graph with given independence number.

[BibT_eX]

[DOI]

Shinya Fujita

Discret. Optim., 2021

On star 5-colorings of sparse graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

A Ramsey-type theorem for the matching number regarding connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice.

[BibT_eX]

[DOI]

Ringi Kim

Electron. J. Comb., 2020

Collapsibility of Non-Cover Complexes of Graphs.

[BibT_eX]

[DOI]

Jinha Kim

Electron. J. Comb., 2020

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.

[BibT_eX]

[DOI]

Shinya Fujita

Tadashi Sakuma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

On the weighted safe set problem on paths and cycles.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.

[BibT_eX]

[DOI]

Ringi Kim

Alexandr V. Kostochka

Douglas B. West

Graphs Comb., 2019

On incidence choosability of cubic graphs.

[BibT_eX]

[DOI]

Sungsik Kang

Discret. Math., 2019

Characterization of forbidden subgraphs for bounded star chromatic number.

[BibT_eX]

[DOI]

Ringi Kim

Discret. Math., 2019

2018

Cycles with two blocks in k-chromatic digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

List 3-dynamic coloring of graphs with small maximum average degree.

[BibT_eX]

[DOI]

Discret. Math., 2018

On safe sets of the Cartesian product of two complete graphs.

[BibT_eX]

Bumtle Kang

Ars Comb., 2018

2017

A graph theoretic approach to the slot allocation problem.

[BibT_eX]

[DOI]

Youngsub Chun

Soc. Choice Welf., 2017

Shellable posets arising from the even subgraphs of a graph.

[BibT_eX]

[DOI]

Seonjeong Park

Electron. Notes Discret. Math., 2017

2016

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

[BibT_eX]

[DOI]

Graphs Comb., 2016

Coloring the square of graphs whose maximum average degree is less than 4.

[BibT_eX]

[DOI]

Discret. Math., 2016

The competition graphs of oriented complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Counterexamples to the List Square Coloring Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

A generalization of Opsut's result on the competition numbers of line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Chromatic-choosability of the power of graphs.

[BibT_eX]

[DOI]

Young Soo Kwon

Discret. Appl. Math., 2015

Bipartite Graphs whose Squares are not Chromatic-Choosable.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Improved bounds on the chromatic numbers of the square of Kneser graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

The competition hypergraphs of doubly partial orders.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

On the cores of games arising from integer edge covering functions of graphs.

[BibT_eX]

[DOI]

Hye Kyung Kim

J. Comb. Optim., 2013

The phylogeny graphs of double partial orders.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

The competition number of the complement of a cycle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

The impact of influential leaders in the formation and development of social networks.

[BibT_eX]

[DOI]

Kibeom Lee

Namjun Kang

Proceedings of the International Conference on Communities and Technologies 2013, 2013

2012

Population solidarity, population fair-ranking, and the egalitarian value.

[BibT_eX]

[DOI]

Youngsub Chun

Int. J. Game Theory, 2012

The competition number of a generalized line graph is at most two.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

On Opsut's conjecture for hypercompetition numbers of hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The competition numbers of complete multipartite graphs with many partite sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

A Dice Rolling Game on a Set of Tori.

[BibT_eX]

[DOI]

Jeehoon Kang

Electron. J. Comb., 2012

The competition number of a graph and the dimension of its hole space.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

On the hypercompetition numbers of hypergraphs.

[BibT_eX]

Ars Comb., 2011

The competition numbers of ternary Hamming graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

The m-step competition graphs of doubly partial orders.

[BibT_eX]

[DOI]

Jung Yeun Lee

Appl. Math. Lett., 2011

2010

The competition numbers of Johnson graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

2009

The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.

[BibT_eX]

[DOI]