| Publication | Date of Publication | Type |
|---|
Sharp bounds for decomposing graphs into edges and triangles
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
10 problems for partitions of triangle-free graphs
European Journal of Combinatorics | 2024-09-30 | Paper |
Relaxation of Wegner's planar graph conjecture for maximum degree 4
Discrete Applied Mathematics | 2024-09-26 | Paper |
Hypergraph Turán Problems in l2-Norm
Surveys in Combinatorics 2022 | 2024-01-05 | Paper |
C5 ${C}_{5}$ is almost a fractalizer
Journal of Graph Theory | 2023-10-10 | Paper |
Coloring count cones of planar graphs
Journal of Graph Theory | 2023-10-05 | Paper |
| Decomposing random regular graphs into stars | 2023-08-30 | Paper |
Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm
Journal of the London Mathematical Society | 2023-08-21 | Paper |
The Spectrum of Triangle-Free Graphs
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
On tripartite common graphs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Making Kr+1-free graphs r-partite
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Embedded graph 3-coloring and flows | 2023-03-09 | Paper |
| Weighted Tur\'an theorems with applications to Ramsey-Tur\'an type of problems | 2023-02-15 | Paper |
| Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4 | 2022-12-20 | Paper |
Shortened universal cycles for permutations
Discrete Applied Mathematics | 2022-11-11 | Paper |
On weak flexibility in planar graphs
Graphs and Combinatorics | 2022-11-04 | Paper |
| Nearly all $k$-SAT functions are unate | 2022-09-11 | Paper |
Planar Turán numbers of cycles: a counterexample
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Counterexamples to a Conjecture of Harris on Hall Ratio
SIAM Journal on Discrete Mathematics | 2022-07-28 | Paper |
Maximum number of almost similar triangles in the plane
Computational Geometry | 2022-06-13 | Paper |
| 11/4-colorability of subcubic triangle-free graphs | 2022-04-26 | Paper |
| 10 Problems for Partitions of Triangle-free Graphs | 2022-03-29 | Paper |
Semidefinite programming and Ramsey numbers
SIAM Journal on Discrete Mathematics | 2021-11-04 | Paper |
Maximizing five-cycles in \(K_r\)-free graphs
European Journal of Combinatorics | 2021-08-05 | Paper |
Sharp bounds for decomposing graphs into edges and triangles
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
| Max Cuts in Triangle-free Graphs | 2021-03-25 | Paper |
| Inducibility of 4-vertex tournaments | 2021-03-11 | Paper |
Inducibility of directed paths
Discrete Mathematics | 2020-08-12 | Paper |
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets
Journal of Graph Theory | 2020-05-21 | Paper |
Decomposing graphs into edges and triangles
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Minimizing the number of 5-cycles in graphs with given edge-density
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Making $K_{r+1}$-Free Graphs $r$-partite
(available as arXiv preprint) | 2019-09-30 | Paper |
Closing in on Hill's conjecture
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Facial unique-maximum colorings of plane graphs with restriction on big vertices
Discrete Mathematics | 2019-07-18 | Paper |
Partition problems in high dimensional boxes
Journal of Combinatorial Theory. Series A | 2019-06-28 | Paper |
Irreversible 2-conversion set in graphs of bounded degree
(available as arXiv preprint) | 2018-12-10 | Paper |
| Irreversible 2-conversion set in graphs of bounded degree | 2018-12-10 | Paper |
Pentagons in triangle-free graphs
European Journal of Combinatorics | 2018-09-07 | Paper |
On the strong chromatic index of sparse graphs
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
On the strong chromatic index of sparse graphs
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains
SIAM Journal on Discrete Mathematics | 2018-07-25 | Paper |
Notes on complexity of packing coloring
Information Processing Letters | 2018-06-15 | Paper |
Independent sets near the lower bound in bounded degree graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
On facial unique-maximum (edge-)coloring
Discrete Applied Mathematics | 2018-02-22 | Paper |
A counterexample to a conjecture on facial unique-maximal colorings
Discrete Applied Mathematics | 2018-02-22 | Paper |
Fine structure of 4-critical triangle-free graphs. III: General surfaces
SIAM Journal on Discrete Mathematics | 2018-01-12 | Paper |
3-coloring triangle-free planar graphs with a precolored 9-cycle
European Journal of Combinatorics | 2017-11-14 | Paper |
\((4,2)\)-choosability of planar graphs with forbidden structures
Graphs and Combinatorics | 2017-10-11 | Paper |
Minimum Number of Monotone Subsequences of Length 4 in Permutations
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Injective choosability of subcubic planar graphs with girth 6
Discrete Mathematics | 2017-08-01 | Paper |
Fine structure of 4-critical triangle-free graphs. II: Planar triangle-free graphs with two precolored 4-cycles
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
5-choosability of graphs with crossings far apart
Journal of Combinatorial Theory. Series B | 2017-01-26 | Paper |
5-list-coloring planar graphs with distant precolored vertices
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
On the tree search problem with non-uniform costs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the tree search problem with non-uniform costs
Theoretical Computer Science | 2016-09-01 | Paper |
Rainbow copies of \(C_4\) in edge-colored hypercubes
Discrete Applied Mathematics | 2016-06-22 | Paper |
On choosability with separation of planar graphs with forbidden cycles
Journal of Graph Theory | 2016-04-15 | Paper |
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
European Journal of Combinatorics | 2015-12-11 | Paper |
3-coloring triangle-free planar graphs with a precolored 8-cycle
Journal of Graph Theory | 2015-09-29 | Paper |
3-coloring triangle-free planar graphs with a precolored 9-cycle
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On choosability with separation of planar graphs with lists of different sizes
Discrete Mathematics | 2015-06-01 | Paper |
Planar 4-critical graphs with four triangles
European Journal of Combinatorics | 2014-09-02 | Paper |
On the Turán number of forests
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
On the Turán number of forests
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
European Journal of Combinatorics | 2014-07-29 | Paper |
4-critical graphs on surfaces without contractible \((\leq 4)\)-cycles
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Short proofs of coloring theorems on planar graphs
European Journal of Combinatorics | 2014-03-25 | Paper |
Peeling the grid
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
The planar slope number of planar partial 3-trees of bounded degree
Graphs and Combinatorics | 2013-07-19 | Paper |
Six-Critical Graphs on the Klein Bottle
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Finding vertex-surjective graph homomorphisms
Acta Informatica | 2012-10-15 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Bipartizing fullerenes
European Journal of Combinatorics | 2012-06-18 | Paper |
Distance three labelings of trees
Discrete Applied Mathematics | 2012-05-11 | Paper |
Packing chromatic number of distance graphs
Discrete Applied Mathematics | 2012-05-04 | Paper |
The \(k\)-in-a-path problem for claw-free graphs
Algorithmica | 2012-04-26 | Paper |
Graphs with two crossings are 5-choosable
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
| The \(k\)-in-a-path problem for claw-free graphs | 2012-01-23 | Paper |
5-coloring graphs with 4 crossings
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Locally injective homomorphism to the simple weight graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
3-choosability of triangle-free planar graphs with constraints on 4-cycles
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Complexity of locally injective homomorphism to the Theta graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Short cycle covers of graphs with minimum degree three
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Randić index and the diameter of a graph
European Journal of Combinatorics | 2011-03-04 | Paper |
\(L(2,1,1)\)-labeling is NP-complete for trees
Lecture Notes in Computer Science | 2010-06-17 | Paper |
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
Graph Drawing | 2010-04-27 | Paper |
6-Critical Graphs on the Klein Bottle
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
Discrete Mathematics | 2009-12-15 | Paper |
| On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles | 2009-07-06 | Paper |
The packing chromatic number of infinite product graphs
European Journal of Combinatorics | 2009-06-17 | Paper |
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
Graph Drawing | 2009-03-03 | Paper |
Triangle Percolation on the Grid
(available as arXiv preprint) | N/A | Paper |
Proper Rainbow Saturation Numbers for Cycles
(available as arXiv preprint) | N/A | Paper |
