| Publication | Date of Publication | Type |
|---|
List recoloring of planar graphs without 4-cycles
Discrete Mathematics | 2026-08-13 | Paper |
Proper conflict-free 6-coloring of planar graphs without short cycles
Applied Mathematics and Computation | 2025-07-23 | Paper |
IC-planar graphs are odd-10-colorable
Applied Mathematics and Computation | 2023-06-26 | Paper |
1-planar graphs are odd 13-colorable
Discrete Mathematics | 2023-05-31 | Paper |
Optimal connectivity for fat-triangle linkages
Discrete Mathematics | 2023-03-10 | Paper |
Spanning tree packing and 2-essential edge-connectivity
Discrete Mathematics | 2022-11-02 | Paper |
A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
Discrete Applied Mathematics | 2022-06-21 | Paper |
Planar graphs without 4-cycles and intersecting triangles are ( 1 , 1 , 0 )-colorable
Discrete Applied Mathematics | 2021-09-30 | Paper |
Planar graphs without short even cycles are near-bipartite
Discrete Applied Mathematics | 2020-07-07 | Paper |
Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs
Discrete Applied Mathematics | 2020-06-29 | Paper |
Planar graphs without 7-cycles and butterflies are DP-4-colorable
Discrete Mathematics | 2020-06-08 | Paper |
DP-4-colorability of planar graphs without adjacent cycles of given length
Discrete Applied Mathematics | 2020-03-23 | Paper |
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
Discrete Applied Mathematics | 2019-09-19 | Paper |
DP-4-colorability of two classes of planar graphs
Discrete Mathematics | 2019-09-11 | Paper |
Minimum degree condition for a graph to be knitted
Discrete Mathematics | 2019-09-11 | Paper |
Every planar graph without adjacent cycles of length at most 8 is 3-choosable
European Journal of Combinatorics | 2019-08-30 | Paper |
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
Graphs and Combinatorics | 2019-06-28 | Paper |
| Fat-triangle linkage and kite-linked graphs | 2019-06-21 | Paper |
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Discrete Mathematics | 2019-01-22 | Paper |
DP-3-coloring of some planar graphs
Discrete Mathematics | 2018-11-13 | Paper |
| DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$ | 2018-09-19 | Paper |
Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable
Discrete Mathematics | 2015-12-08 | Paper |
A relaxation of the Bordeaux conjecture
European Journal of Combinatorics | 2015-06-18 | Paper |
