1. Piercing d -Intervals
2. On graphs which contain all sparse graphs;Babai L.;Ann. Discrete Math.,1982
3. F. R. K.Chung Separator theorems and their applications. InPaths flows and VLSI‐layout (Bonn 1988) Algorithms and Combinatorics vol.9 Springer Berlin 1990 pp.17–34.
4. Planar Graphs Have Bounded Queue-Number
5. Z.Dvořák A stronger structure theorem for excluded topological minors arXiv:1209.0129.