Ramsey-type results for geometric graphs
Proceedings of the twelfth annual symposium on Computational geometry
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 minimum monochromatic or multicolored subgraph partition problems
Theoretical Computer Science
Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles
Combinatorics, Probability and Computing
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 |