| Publication | Date of Publication | Type |
|---|
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Discrete Mathematics | 2023-07-19 | Paper |
The chromatic number of signed graphs with bounded maximum average degree
Discrete Applied Mathematics | 2022-05-30 | Paper |
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
European Journal of Combinatorics | 2021-02-08 | Paper |
On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\)
Discrete Applied Mathematics | 2020-05-18 | Paper |
Oriented cliques and colorings of graphs with low maximum degree
Discrete Mathematics | 2020-03-20 | Paper |
Acyclic coloring of graphs and entropy compression method
Discrete Mathematics | 2020-02-20 | Paper |
Homothetic triangle representations of planar graphs
Journal of Graph Algorithms and Applications | 2019-10-25 | Paper |
Oriented coloring of graphs with low maximum degree
| 2019-05-29 | Paper |
On the difference between the Szeged and the Wiener index
Applied Mathematics and Computation | 2019-04-29 | Paper |
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
Discrete Mathematics | 2019-02-20 | Paper |
Large induced forests in planar graphs with girth 4
Discrete Applied Mathematics | 2019-02-08 | Paper |
Partitioning sparse graphs into an independent set and a forest of bounded degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On repetition thresholds of caterpillars and trees of bounded degree
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
European Journal of Combinatorics | 2017-09-11 | Paper |
Homomorphisms of 2-edge-colored triangle-free planar graphs
Journal of Graph Theory | 2017-06-30 | Paper |
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
A lower bound on the order of the largest induced forest in planar graphs with high girth
Discrete Applied Mathematics | 2016-09-30 | Paper |
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2016-05-24 | Paper |
2-distance coloring of sparse graphs
Journal of Graph Theory | 2014-11-17 | Paper |
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Application of entropy compression in pattern avoidance
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
List coloring the square of sparse graphs with large degree
European Journal of Combinatorics | 2014-09-02 | Paper |
Entropy compression method applied to graph colorings
| 2014-06-17 | Paper |
Locally identifying coloring in bounded expansion classes of graphs
Discrete Applied Mathematics | 2014-04-23 | Paper |
Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
Discrete Mathematics | 2014-01-17 | Paper |
Homomorphisms of signed planar graphs
| 2014-01-14 | Paper |
2-distance coloring of sparse graphs
| 2013-11-01 | Paper |
Chromatic number of sparse colored mixed planar graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Spanning galaxies in digraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
A Complexity Dichotomy for the Coloring of Sparse Graphs
Journal of Graph Theory | 2013-05-21 | Paper |
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
| 2013-01-29 | Paper |
Triangle contact representations and duality
Discrete \& Computational Geometry | 2012-08-13 | Paper |
On spanning galaxies in digraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
The domination number of grids
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Triangle Contact Representations and Duality
Graph Drawing | 2011-02-11 | Paper |
Homomorphisms of 2-edge-colored graphs
Discrete Applied Mathematics | 2010-08-13 | Paper |
Oriented colorings of partial 2-trees
Information Processing Letters | 2010-06-09 | Paper |
Acyclic improper colourings of graphs with bounded maximum degree
Discrete Mathematics | 2010-03-29 | Paper |
Oriented vertex and arc colorings of outerplanar graphs
Information Processing Letters | 2010-01-29 | Paper |
An oriented coloring of planar graphs with girth at least five
Discrete Mathematics | 2009-06-19 | Paper |
Oriented vertex and arc colorings of partial 2-trees
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Homomorphisms of 2-edge-colored graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Strong oriented chromatic number of planar graphs without cycles of specific lengths
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Strong oriented chromatic number of planar graphs without short cycles
| 2008-05-27 | Paper |
On the oriented chromatic index of oriented graphs
Journal of Graph Theory | 2008-05-14 | Paper |
Acyclic improper choosability of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The acircuitic directed star arboricity of subcubic graphs is at most four
Discrete Mathematics | 2006-12-14 | Paper |
On arc-coloring of subcubic graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
