Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
Combinatorics, Probability and Computing
An improved bound for the monochromatic cycle partition number
Journal of Combinatorial Theory Series B
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
On the minimum monochromatic or multicolored subgraph partition problems
Theoretical Computer Science
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |