Unavoidable minors of graphs of large type
Discrete Mathematics
Ka,k minors in graphs of bounded tree-width
Journal of Combinatorial Theory Series B
On the Number of Elements in Matroids with Small Circuits or Cocircuits
Combinatorics, Probability and Computing
The Matroid Ramsey Number n(6,6)
Combinatorics, Probability and Computing
The circumference of a graph with no K3,t-minor
Journal of Combinatorial Theory Series B
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
The edge-density for K2,t minors
Journal of Combinatorial Theory Series B
Large non-planar graphs and an application to crossing-critical graphs
Journal of Combinatorial Theory Series B
Unavoidable parallel minors of regular matroids
European Journal of Combinatorics
Nested cycles in large triangulations and crossing-critical graphs
Journal of Combinatorial Theory Series B
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Capturing matroid elements in unavoidable 3-connected minors
European Journal of Combinatorics
Minors in large almost-5-connected non-planar graphs
Journal of Graph Theory
The circumference of a graph with no K3,t-minor, II
Journal of Combinatorial Theory Series B
European Journal of Combinatorics
Hi-index | 0.01 |