Trees with three leaves are (n + 1)-unavoidable
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Paths with two blocks in n-chromatic digraphs
Journal of Combinatorial Theory Series B
An approximate version of Sumner's universal tournament conjecture
Journal of Combinatorial Theory Series B
A survey on Hamilton cycles in directed graphs
European Journal of Combinatorics
Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |