| Publication | Date of Publication | Type |
|---|
Homomorphically full oriented graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
On the minimum number of arcs in \(k\)-dicritical oriented graphs
SIAM Journal on Discrete Mathematics | 2024-06-25 | Paper |
scientific article; zbMATH DE number 7803599 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7765417 (Why is no real title available?) | 2023-11-14 | Paper |
The smallest 5-chromatic tournament
Mathematics of Computation | 2023-10-23 | Paper |
Proper‐walk connection number of graphs
Journal of Graph Theory | 2023-09-29 | Paper |
Locating-dominating sets in local tournaments
Discrete Applied Mathematics | 2023-06-15 | Paper |
The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
Algorithmica | 2023-04-28 | Paper |
On the density of sets of the Euclidean plane avoiding distance 1
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
On the density of sets of the Euclidean plane avoiding distance 1
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
| On the minimum number of arcs in $k$-dicritical oriented graphs | 2022-07-03 | Paper |
On DP‐coloring of digraphs
Journal of Graph Theory | 2022-03-31 | Paper |
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
On supereulerian 2-edge-coloured graphs
Graphs and Combinatorics | 2021-11-30 | Paper |
Hajós and Ore constructions for digraphs
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Hajós and Ore constructions for digraphs
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
The directed 2-linkage problem with length constraints
Theoretical Computer Science | 2020-03-12 | Paper |
The directed 2-linkage problem with length constraints
Theoretical Computer Science | 2020-03-12 | Paper |
On the density of sets avoiding parallelohedron distance 1
Discrete & Computational Geometry | 2019-09-11 | Paper |
On the density of sets avoiding parallelohedron distance 1
Discrete & Computational Geometry | 2019-09-11 | Paper |
| Proper-walk connection number of graphs | 2019-06-30 | Paper |
On DP-Coloring of Digraphs
(available as arXiv preprint) | 2018-12-23 | Paper |
Complexity of locally-injective homomorphisms to tournaments
(available as arXiv preprint) | 2018-12-10 | Paper |
| Complexity of locally-injective homomorphisms to tournaments | 2018-12-10 | Paper |
On minimum connecting transition sets in graphs
(available as arXiv preprint) | 2018-11-22 | Paper |
On Minimum Connecting Transition Sets in Graphs
(available as arXiv preprint) | 2018-07-23 | Paper |
Separating codes and traffic monitoring
Theoretical Computer Science | 2018-03-13 | Paper |
Separating codes and traffic monitoring
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Homomorphically Full Oriented Graphs
(available as arXiv preprint) | N/A | Paper |
