Seog-Jin Kim

J. Graph Theory, 2022

Planar graphs without intersecting 5-cycles are signed-4-choosable.

[BibT_eX]

[DOI]

Xiaowei Yu

Discret. Math. Algorithms Appl., 2022

The Alon-Tarsi number of K5-minor-free graphs.

[BibT_eX]

[DOI]

Toshiki Abe

Kenta Ozeki

Discret. Math., 2022

2021

On list 3-dynamic coloring of near-triangulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions.

[BibT_eX]

[DOI]

Symmetry, 2020

Planar graphs without 7-cycles and butterflies are DP-4-colorable.

[BibT_eX]

[DOI]

Runrun Liu

Gexin Yu

Discret. Math., 2020

The minimum spectral radius of Kr+1-saturated graphs.

[BibT_eX]

[DOI]

Jaehoon Kim

Suil O

Discret. Math., 2020

On-line DP-coloring of graphs.

[BibT_eX]

[DOI]

Xuer Li

Discret. Appl. Math., 2020

2019

A note on a Brooks' type theorem for DP?coloring.

[BibT_eX]

[DOI]

Kenta Ozeki

J. Graph Theory, 2019

Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable.

[BibT_eX]

[DOI]

Xiaowei Yu

Graphs Comb., 2019

Coloring squares of graphs with mad constraints.

[BibT_eX]

[DOI]

Hervé Hocquard

Théo Pierron

Discret. Appl. 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

A sufficient condition for DP-4-colorability.

[BibT_eX]

[DOI]

Kenta Ozeki

Discret. Math., 2018

3-dynamic coloring of planar triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.

[BibT_eX]

[DOI]

Min Chen

J. Comb. Theory, Ser. B, 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

2015

Counterexamples to the List Square Coloring Conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 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

2013

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.

[BibT_eX]

[DOI]

Hehui Wu

J. Graph Theory, 2013

Dynamic coloring and list dynamic coloring of planar graphs.

[BibT_eX]

[DOI]

Sangjune Lee

Won-Jin Park

Discret. Appl. Math., 2013

Injectively (Δ+1)-choosable graphs.

[BibT_eX]

Won-Jin Park

Ars Comb., 2013

2012

Graph Equation for Line Graphs and m-Step Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

On-Line List Colouring of Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes.

[BibT_eX]

[DOI]

Jon-Lark Kim

Discret. Appl. Math., 2011

Graphs having many holes but with small competition numbers.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Injective Colorings of Graphs with Low Average Degree.

[BibT_eX]

[DOI]

Daniel W. Cranston

Gexin Yu

Algorithmica, 2011

List Dynamic Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

Won-Jin Park

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Injective colorings of sparse graphs.

[BibT_eX]

[DOI]

Daniel W. Cranston

Gexin Yu

Discret. Math., 2010

The competition number of a graph with exactly two holes.

[BibT_eX]

Ars Comb., 2010

2008

List-coloring the square of a subcubic graph.

[BibT_eX]

[DOI]

Daniel W. Cranston

J. Graph Theory, 2008

Triangle-free planar graphs with minimum degree 3 have radius at least 3.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

Coloring the complements of intersection graphs of geometric figures.

[BibT_eX]

[DOI]

Kittikorn Nakprasit

Discret. Math., 2008

2007

On CCE graphs of doubly partial orders.

[BibT_eX]

[DOI]

Suh-Ryung Kim

Yoomi Rho

Discret. Appl. Math., 2007

2006

Transversal numbers of translates of a convex body.

[BibT_eX]

[DOI]

Discret. Math., 2006

2004

Homomorphisms from sparse graphs with large girth.

[BibT_eX]

[DOI]

Oleg V. Borodin

J. Comb. Theory, Ser. B, 2004

On the Chromatic Number of the Square of the Kneser Graph K(2 k+1, k).

[BibT_eX]

[DOI]

Kittikorn Nakprasit

Graphs Comb., 2004

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.

[BibT_eX]

[DOI]

Kittikorn Nakprasit

Electron. J. Comb., 2004

2003

Isometric cycles, cutsets, and crowning of bridged graphs.

[BibT_eX]

[DOI]

Tao Jiang