Learn More
The tree-width of a graph G is the minimum k such that G may be decomposed into a " tree-structure " of pieces each with at most k + 1 vertices. We prove that this equals the maximum k such that there is a collection of connected subgraphs, pairwise intersecting or adjacent, such that no set of ≤ k vertices meets all of them. A corollary is an analogue of(More)
We generalize the concept of tree-width to directed graphs, and prove that every directed graph with no " haven " of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved in polynomial time when restricted to digraphs of bounded(More)
Staton proved that every triangle-free graph on n vertices with maximum degree three has an independent set of size at least 5n=14. A simpler proof was found by Jones. We give a yet simpler proof, and use it to design a linear-time algorithm to nd such an independent set. Let G be a triangle-free graph on n vertices with maximum degree three. By Brooks'(More)
corresponds to G in time 0(n3/2). We also describe Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorphic to a given h-vertex graph H. We prove that there is a set X of no more than h3/2nl/2 vertices of G whose deletion creates a graph in which the total weight of every connected component(More)