| Publication | Date of Publication | Type |
|---|
Ramsey numbers for partially-ordered sets
Order | 2018-10-09 | Paper |
On the strong chromatic index of sparse graphs
The Electronic Journal of Combinatorics | 2018-08-15 | Paper |
Extending precolorings to distinguish group actions
European Journal of Combinatorics | 2018-06-28 | Paper |
Choosability with union separation
Discrete Mathematics | 2018-01-19 | Paper |
\((4,2)\)-choosability of planar graphs with forbidden structures
Graphs and Combinatorics | 2017-10-11 | Paper |
Color-blind index in graphs of very low degree
Discrete Applied Mathematics | 2017-05-12 | Paper |
Rainbow arithmetic progressions
Journal of Combinatorics | 2016-11-22 | Paper |
On the independence ratio of distance graphs
Discrete Mathematics | 2016-08-16 | Paper |
Partitioning a graph into highly connected subgraphs
Journal of Graph Theory | 2016-08-12 | Paper |
I,F-partitions of sparse graphs
European Journal of Combinatorics | 2016-06-20 | Paper |
On choosability with separation of planar graphs with forbidden cycles
Journal of Graph Theory | 2016-04-15 | Paper |
Ordered Ramsey numbers of loose paths and matchings
Discrete Mathematics | 2015-12-08 | Paper |
Ordered Ramsey theory and track representations of graphs
Journal of Combinatorics | 2015-11-10 | Paper |
Automorphism groups and adversarial vertex deletions
| 2015-01-14 | Paper |
\textsc{ReachFewL} = \textsc{ReachUL}
Computational Complexity | 2014-09-25 | Paper |
Automated Discharging Arguments for Density Problems in Grids
| 2014-09-20 | Paper |
A linear programming approach to the Manickam-Miklós-Singhi conjecture
European Journal of Combinatorics | 2014-03-25 | Paper |
Extremal graphs with a given number of perfect matchings
Journal of Graph Theory | 2013-07-31 | Paper |
Uniquely \(K_r\)-saturated graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
List distinguishing parameters of trees
Discrete Applied Mathematics | 2013-04-18 | Paper |
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture
| 2013-02-14 | Paper |
On the hardness of recognizing triangular line graphs
Discrete Mathematics | 2012-08-10 | Paper |
ReachFewL = ReachUL
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Generating p-extremal graphs
| 2011-05-09 | Paper |
Isomorph-free generation of 2-connected graphs with applications
| 2011-04-27 | Paper |
Automorphism groups of a graph and a vertex-deleted subgraph
The Electronic Journal of Combinatorics | 2010-10-13 | Paper |
