| Publication | Date of Publication | Type |
|---|
Extremal graphs for the suspension of edge-critical graphs
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Generating non-jumps from a known one
Science China. Mathematics | 2024-12-06 | Paper |
A 2-stable family of triple systems
The Electronic Journal of Combinatorics | 2024-04-09 | Paper |
| Toward a density Corr\'{a}di--Hajnal theorem for degenerate hypergraphs | 2023-11-25 | Paper |
| Many vertex-disjoint even cycles of fixed length in a graph | 2023-11-25 | Paper |
| Counting triangles in graphs without vertex disjoint odd cycles | 2023-10-29 | Paper |
On bisections of graphs without complete bipartite graphs
Journal of Graph Theory | 2023-10-04 | Paper |
Gallai's conjecture on path decompositions
Journal of the Operations Research Society of China | 2023-09-12 | Paper |
| Hypergraphs with irrational Tur\'{a}n density and many extremal configurations | 2023-08-18 | Paper |
Graph partitioning: an updated survey
AKCE International Journal of Graphs and Combinatorics | 2023-08-02 | Paper |
| MaxCut in graphs with sparse neighborhoods | 2023-07-18 | Paper |
On \(L (p, q)\)-labelling of planar graphs without cycles of length four
Applied Mathematics and Computation | 2023-04-21 | Paper |
On \(( 2 , r )\)-choosability of planar graphs without short cycles
Applied Mathematics and Computation | 2023-04-21 | Paper |
Singular Turán numbers of stars
Pure and Applied Mathematics Quarterly | 2023-04-05 | Paper |
Large induced subgraphs with three repeated degrees
Discrete Mathematics | 2023-03-10 | Paper |
Coloring squares of planar graphs with maximum degree at most five
Graphs and Combinatorics | 2023-03-09 | Paper |
| A step towards a general density Corr\'{a}di--Hajnal Theorem | 2023-02-20 | Paper |
| Extremal graphs for the suspension of edge-critical graphs | 2022-11-15 | Paper |
| Two stability theorems for $\mathcal{K}_{\ell + 1}^{r}$-saturated hypergraphs | 2022-11-05 | Paper |
| Generating non-jumps from a known one | 2022-08-01 | Paper |
On judicious bipartitions of directed graphs
Discrete Mathematics | 2022-06-14 | Paper |
Odd induced subgraphs in planar graphs with large girth
Graphs and Combinatorics | 2022-06-08 | Paper |
| Hypergraphs with infinitely many extremal constructions | 2022-06-08 | Paper |
Maximum bisections of graphs without cycles of length 4
Discrete Mathematics | 2022-05-27 | Paper |
On \((3, r)\)-choosability of some planar graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2022-03-21 | Paper |
Coloring graphs without bichromatic cycles or paths
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2021-08-12 | Paper |
Uniform tight frames as optimal signals
Advances in Applied Mathematics | 2021-07-15 | Paper |
Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
SIAM Journal on Discrete Mathematics | 2021-03-18 | Paper |
Choosability with union separation of planar graphs without cycles of length 4
Applied Mathematics and Computation | 2021-03-16 | Paper |
Choosability with union separation of triangle-free planar graphs
Discrete Mathematics | 2020-10-08 | Paper |
A bound on judicious bipartitions of directed graphs
Science China. Mathematics | 2020-03-06 | Paper |
Max-bisections of \(H\)-free graphs
Discrete Mathematics | 2019-12-12 | Paper |
On bipartitions of directed graphs with small semidegree
European Journal of Combinatorics | 2019-11-28 | Paper |
Maximum cuts of graphs with forbidden cycles
Ars Mathematica Contemporanea | 2019-02-01 | Paper |
On partitions of \(K_{2, 3}\)-free graphs under degree constraints
Discrete Mathematics | 2018-10-23 | Paper |
Graphs of \(f\)-class 1
Discrete Applied Mathematics | 2018-09-25 | Paper |
Bipartitions of oriented graphs
Journal of Combinatorial Theory. Series B | 2018-07-24 | Paper |
The Bollobás-Scott conjecture for 4-uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2018-02-22 | Paper |
Partitioning dense uniform hypergraphs
Journal of Combinatorial Optimization | 2018-02-21 | Paper |
Bisections of graphs without short cycles
Combinatorics, Probability and Computing | 2018-01-19 | Paper |
Judicious partitioning of hypergraphs with edges of size at most 2
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Bounds for the number of meeting edges in graph partitioning.
Czechoslovak Mathematical Journal | 2017-09-06 | Paper |
On a problem of judicious \(k\)-partitions of graphs
Journal of Graph Theory | 2017-08-08 | Paper |
Bipartite subgraphs of \(H\)-free graphs
Bulletin of the Australian Mathematical Society | 2017-08-07 | Paper |
On bisections of directed graphs
European Journal of Combinatorics | 2017-06-19 | Paper |
Biased partitions and judicious \(k\)-partitions of graphs
Acta Mathematica Sinica, English Series | 2017-06-01 | Paper |
Monochromatic solutions for multi-term unknowns
Graphs and Combinatorics | 2017-01-13 | Paper |
Bounds for pairs in judicious partitioning of graphs
Random Structures & Algorithms | 2017-01-10 | Paper |
On judicious partitions of uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2016-04-20 | Paper |
Acyclic coloring of graphs without bichromatic long path
Frontiers of Mathematics in China | 2015-11-06 | Paper |
On total colorings of 1-planar graphs
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
A bound for judicious \(k\)-partitions of graphs
Discrete Applied Mathematics | 2014-12-03 | Paper |
Acyclic edge coloring of triangle-free toroidal graphs
Journal of Shandong University. Natural Science | 2014-11-03 | Paper |
Acyclic edge coloring of planar graphs with girth at least 5
Discrete Applied Mathematics | 2014-04-23 | Paper |
Every toroidal graph is acyclically 8-choosable
Acta Mathematica Sinica, English Series | 2014-03-18 | Paper |
Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs”
Journal of Graph Theory | 2013-04-19 | Paper |
An improved bound on acyclic chromatic index of planar graphs
Discrete Mathematics | 2013-04-17 | Paper |
Acyclic chromatic index of planar graphs with triangles
Information Processing Letters | 2013-04-04 | Paper |
List total colorings of planar graphs without triangles at small distance
Acta Mathematica Sinica, English Series | 2013-03-18 | Paper |
Acyclic edge coloring of planar graphs without small cycles
Graphs and Combinatorics | 2012-12-27 | Paper |
A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
A planar linear arboricity conjecture
Journal of Graph Theory | 2012-06-13 | Paper |
On the total choosability of planar graphs and of sparse graphs
Information Processing Letters | 2012-03-27 | Paper |
| Acyclic edge coloring of sparse graphs | 2012-02-28 | Paper |
| A new sufficient condition for graphs of \(f\)-class 1. | 2012-02-20 | Paper |
| Bondage number of planar graphs without small cycles | 2011-08-16 | Paper |
| scientific article; zbMATH DE number 5914884 (Why is no real title available?) | 2011-06-29 | Paper |
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Discrete Applied Mathematics | 2011-05-17 | Paper |
Improved bounds for acyclic chromatic index of planar graphs
Discrete Applied Mathematics | 2011-05-17 | Paper |
The method of coloring in graphs and its application
Journal of Systems Science and Complexity | 2011-04-05 | Paper |
Total coloring of embedded graphs of maximum degree at least ten
Science China. Mathematics | 2011-02-25 | Paper |
Total coloring of planar graphs without 6-cycles
Discrete Applied Mathematics | 2011-01-21 | Paper |
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
International Journal of Computer Mathematics | 2011-01-20 | Paper |
Acyclic edge chromatic number of outerplanar graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Edge-choosability of planar graphs without non-induced 5-cycles
Information Processing Letters | 2010-06-16 | Paper |
List edge and list total colorings of planar graphs without short cycles
Information Processing Letters | 2010-06-09 | Paper |
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Discrete Mathematics | 2009-12-15 | Paper |
Acyclic edge colorings of planar graphs and series parallel graphs
Science in China. Series A | 2009-12-07 | Paper |
Acyclic edge coloring of planar graphs with large girth
Theoretical Computer Science | 2009-11-06 | Paper |
The stability number and connected \([k,k+1\)-factor in graphs]
Applied Mathematics Letters | 2009-06-10 | Paper |
Total colorings of planar graphs without adjacent triangles
Discrete Mathematics | 2009-01-28 | Paper |
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
Discrete Mathematics | 2009-01-28 | Paper |
Binding number and Hamiltonian (g, f)-factors in graphs II
International Journal of Computer Mathematics | 2008-09-24 | Paper |
Total colorings of planar graphs without small cycles
Graphs and Combinatorics | 2008-08-20 | Paper |
Some results about f‐critical graphs
Networks | 2008-01-07 | Paper |
Some properties on \(f\)-edge covered critical graphs
Journal of Applied Mathematics and Computing | 2007-10-22 | Paper |
The linear arboricity of planar graphs with no short cycles
Theoretical Computer Science | 2007-09-03 | Paper |
List edge and list total colorings of planar graphs without 4-cycles
Theoretical Computer Science | 2007-01-09 | Paper |
Faster coloring and embedding in dense hypergraphs via stability
(available as arXiv preprint) | N/A | Paper |
