| Publication | Date of Publication | Type |
|---|
Proper conflict-free coloring of graphs with large maximum degree
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Clustered coloring of graphs with bounded layered treewidth and bounded degree
European Journal of Combinatorics | 2024-09-30 | Paper |
Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
Journal of the European Mathematical Society (JEMS) | 2024-08-02 | Paper |
scientific article; zbMATH DE number 7788457 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
Discrete Mathematics | 2023-10-30 | Paper |
| Weak diameter choosability of graphs with an excluded minor | 2023-10-26 | Paper |
| Assouad-Nagata dimension of minor-closed metrics | 2023-08-23 | Paper |
Packing topological minors half‐integrally
Journal of the London Mathematical Society | 2023-08-22 | Paper |
Phase transition of degeneracy in minor-closed families
Advances in Applied Mathematics | 2023-03-09 | Paper |
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
Immersion and clustered coloring
Journal of Combinatorial Theory. Series B | 2022-11-23 | Paper |
| Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree | 2022-09-25 | Paper |
Legacy of Robin Thomas
Notices of the American Mathematical Society | 2022-08-31 | Paper |
| Defective coloring is perfect for minors | 2022-08-23 | Paper |
A unified proof of conjectures on cycle lengths in graphs
IMRN. International Mathematics Research Notices | 2022-06-16 | Paper |
A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Notes on graph product structure theory
(available as arXiv preprint) | 2021-12-10 | Paper |
Clustered variants of Hajós' conjecture
Journal of Combinatorial Theory. Series B | 2021-11-17 | Paper |
Packing and covering immersions in 4-edge-connected graphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
| Homomorphism counts in robustly sparse graphs | 2021-07-02 | Paper |
Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates
IEEE Transactions on Information Theory | 2021-02-24 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
Recent progress on well-quasi-ordering graphs
Trends in Logic | 2020-07-08 | Paper |
| Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation | 2020-05-30 | Paper |
Phase Transition of Degeneracy in Minor-Closed Families
(available as arXiv preprint) | 2019-12-04 | Paper |
Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
Journal of Graph Theory | 2019-10-31 | Paper |
| Clustered Coloring of Graphs Excluding a Subgraph and a Minor | 2019-05-23 | Paper |
| Clustered Graph Coloring and Layered Treewidth | 2019-05-22 | Paper |
Size of the largest induced forest in subcubic graphs of girth at least four and five
Journal of Graph Theory | 2019-01-03 | Paper |
Excluding subdivisions of bounded degree graphs
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
SIAM Journal on Discrete Mathematics | 2018-06-07 | Paper |
Domination in tournaments
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five
Journal of Graph Theory | 2017-12-01 | Paper |
Cycle lengths and minimum degree of graphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Minimum size of feedback vertex sets of planar graphs of girth at least five
European Journal of Combinatorics | 2016-12-27 | Paper |
Edge Roman domination on graphs
Graphs and Combinatorics | 2016-11-29 | Paper |
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Deploying robots with two sensors in \(K_{1,6}\)-free graphs
Journal of Graph Theory | 2016-08-12 | Paper |
An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
Linear colorings of subcubic graphs
European Journal of Combinatorics | 2014-04-11 | Paper |
Trees with strong equality between the roman domination number and the unique response Roman domination number
The Australasian Journal of Combinatorics | 2014-01-03 | Paper |
Roman domination on strongly chordal graphs
Journal of Combinatorial Optimization | 2013-12-02 | Paper |
A new bound for the 2/3 conjecture
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
Roman domination on 2-connected graphs
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Upper bounds on Roman domination numbers of graphs
Discrete Mathematics | 2012-03-16 | Paper |
Proper Conflict-free Coloring of Graphs with Large Maximum Degree
(available as arXiv preprint) | N/A | Paper |
Asymptotically Optimal Proper Conflict-Free Colouring
(available as arXiv preprint) | N/A | Paper |
Peaceful Colourings
(available as arXiv preprint) | N/A | Paper |
Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
(available as arXiv preprint) | N/A | Paper |
