We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...