| Publication | Date of Publication | Type |
|---|
| CLBA: a Coulomb's law based algorithm for community detection in directed networks | 2024-09-19 | Paper |
| A note on the independence and fractional matching numbers in random graphs | 2024-07-29 | Paper |
| Second neighborhood via probabilistic argument | 2024-05-06 | Paper |
| \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament | 2023-08-21 | Paper |
| Majority choosability of 1-planar digraph | 2023-08-17 | Paper |
| List injective coloring of planar graphs | 2023-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5037979 | 2022-09-29 | Paper |
| 随机图的$f$-染色的分类 II | 2022-09-29 | Paper |
| Acyclic coloring of claw-free graphs with small degree | 2022-09-15 | Paper |
| List injective coloring of planar graphs | 2022-07-15 | Paper |
| List injective coloring of planar graphs with disjoint 5−-cycles | 2022-06-21 | Paper |
| Neighbor sum distinguishing index of sparse graphs | 2020-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5209828 | 2020-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5206433 | 2019-12-18 | Paper |
| An upper bound for the choice number of star edge coloring of graphs | 2019-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5196117 | 2019-10-02 | Paper |
| The classification of \(f\)-coloring of graphs with large maximum degree | 2019-04-29 | Paper |
| Improved upper bound for generalized acyclic chromatic number of graphs | 2018-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368535 | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5367618 | 2017-10-20 | Paper |
| Improved upper bound for the degenerate and star chromatic numbers of graphs | 2017-10-17 | Paper |
| Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles | 2017-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2992094 | 2016-08-10 | Paper |
| Acyclic coloring of graphs with some girth restriction | 2016-05-11 | Paper |
| Neighbor sum distinguishing total choosability of planar graphs without 4-cycles | 2016-05-02 | Paper |
| List edge coloring of planar graphs without non-induced 6-cycles | 2015-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173722 | 2015-02-16 | Paper |
| A note on the existence of fractional \(f\)-factors in random graphs | 2014-12-09 | Paper |
| Total coloring of planar graphs without 7-cycles with chords | 2014-11-03 | Paper |
| A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable | 2014-06-11 | Paper |
| \(f\)-class two graphs whose \(f\)-cores have maximum degree two | 2014-06-03 | Paper |
| A degree condition for the existence of connected \([k, k + 1]\)-factors with prescribed properties | 2014-01-21 | Paper |
| Total coloring of planar graphs with maximum degree 8 and without specified subgraphs | 2013-11-19 | Paper |
| The generalized acyclic chromatic number of graphs with large girth | 2013-11-19 | Paper |
| A degree condition for \(k\)-uniform graphs | 2013-07-12 | Paper |
| A toughness condition for the existence of \(f\)-factors in graphs | 2013-07-12 | Paper |
| Some results on \((g,f)\)-uniform graphs | 2013-07-12 | Paper |
| Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles | 2013-06-26 | Paper |
| Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable | 2013-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166445 | 2012-10-12 | Paper |
| Edge-choosability of planar graphs without chordal 6-cycles | 2012-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115075 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011817 | 2011-06-29 | Paper |
| A note on edge-choosability of planar graphs without intersecting 4-cycles | 2011-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070357 | 2011-02-02 | Paper |
| Edge-choosability of planar graphs without non-induced 5-cycles | 2010-06-16 | Paper |
| Degree and stability number condition for the existence of connected factors in graphs | 2009-10-26 | Paper |
| The stability number and connected \([k,k+1]\)-factor in graphs | 2009-06-10 | Paper |
| Edge-choosability of planar graphs without adjacent triangles or without 7-cycles | 2009-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3545990 | 2008-12-18 | Paper |
| Binding number and Hamiltonian (g, f)-factors in graphs II | 2008-09-24 | Paper |
| Binding number and Hamiltonian \((g,f)\)-factors in graphs | 2008-02-22 | Paper |
| Some results about f‐critical graphs | 2008-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3428672 | 2007-03-29 | Paper |
| List edge and list total colorings of planar graphs without 4-cycles | 2007-01-09 | Paper |
