N. ROBERTSON AND P. D. SEYMOUR, Graph width and well-quasi-ordering: A survey, in "Progress in Graph Theory" (J.A. Bondy and U.S.R. Murty, Eds.), pp. 399406, Academic Press, San Diego/Toronto, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....4. 1 for other results concerning search games on graphs see [1, 7, 9, 15, 16, 23] The problems of computing es(G) ns(G) ms(G) or linear width(G) is NP complete (see [16, 14, 24, 25] On the other hand, since all of these parameters are closed under taking of minors, we know (see e.g. [3, 19, 20, 22, 21]) that, for any k, there exists a linear algorithm that given a graph G checks whether es(G) ns(G) ms(G) or linear width(G) is at most k (in other words, all these parameters are fixed parameter tractable ) Unfortunately, the above result is not constructive i.e. does not provide a way to ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....of Researchers (TMR) Program, EU contract no ERBFMBICT950198) The obstruction set of a graph class G namely ob(G) is defined to be the set of the minor minimal graphs that do not belong in G. According to the result of Robertson and Seymour in their Graphs Minors series of papers (see [28] for a survey) the minor minimal elements of any graph class are finite. It follows that if a graph class G is closed under taking of minors then, for any graph G, G 2 G iff none of the graphs in ob(G) is a minor of G. In the same series of papers, Robertson and Seymour prove that there exist a ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....minors if, for every k, G[f; k] is closed under taking of minors. The obstruction set of a graph class G namely ob(G) is defined to be the set of the minor minimal graphs that do not belong in G. According to the result of Robertson and Seymour in their Graphs Minors series of papers (see [32] for a survey) the minor minimal elements of any graph class are finite. It follows that if a graph class G is closed under taking of minors then, for any graph G, G 2 G iff none of the graphs in ob(G) is a minor of G. In the same series of papers, Robertson and Seymour prove that there exists an ....

N. Robertson, P.D. Seymour, Graph width and well-quasi ordering: a survey, in J. A. Bondy and U. S. R. Murty (Eds.), Progress in Graph Theory, Academic Press, Toronto, 1984, pp. 399--406.

....4. 1 for other results concerning search games on graphs see [1, 8, 10, 16, 17, 25] The problems of computing es(G) ns(G) ms(G) or linear width(G) is NP complete (see [17, 15, 27, 29] On the other hand, since all of these parameters are closed under taking of minors, we know (see e.g. [3, 20, 21, 23, 22]) that, for any k, there exists a linear algorithm that given a graph G checks whether es(G) ns(G) ms(G) or linear width(G) is at most k (in other words, all these parameters are fixed parameter tractable ) Unfortunately, the above result is not constructive i.e. does not provide a way to ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....binary search over the set of critical values. In either case we obtain a poly log algorithm with mn O(logn) processors for computing over any ordered field. Once is known, we can solve the system S 0 with = 7. NC solutions to systems of bounded tree width Robertson and Seymour [14] introduced the notion of the tree width of a graph. This notion lends itself via the constraints graph to systems of linear inequalities with at most two variables per inequality. Definition 7.1. A connected graph G is said to have tree width less than or equal to k if there is a family V = fV 1 ....

N. Robertson and P. D. Seymour, "Graph width and well-quasi-ordering: a survey".

....of Researchers (TMR) Program, EU contract no ERBFMBICT950198) The obstruction set of a graph class G namely ob(G) is defined to be the set of the minor minimal graphs that do not belong in G. According to the result of Robertson and Seymour in their Graphs Minors series of papers (see [28] for a survey) the minor minimal elements of any graph class are finite. It follows that if a graph class G is closed under taking of minors then, for any graph G, G 2 G iff none of the graphs in ob(G) is a minor of G. In the same series of papers, Robertson and Seymour prove that there exist a ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....4. 1 for other results concerning search games on graphs see [1, 7, 9, 15, 16, 23] The problems of computing es(G) ns(G) ms(G) or linear width(G) is NP complete (see [16, 14, 24, 25] On the other hand, since all of these parameters are closed under taking of minors, we know (see e.g. [3, 19, 20, 22, 21]) that, for any k, there exists a linear algorithm that given a graph G checks whether es(G) ns(G) ms(G) or linear width(G) is at most k (in other words, all these parameters are fixed parameter tractable ) Unfortunately, the above result is not constructive i.e. does not provide a way to ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....Ontario N2L 3G1, Canada, email: sedthilk plg.uwaterloo.ca The obstruction set of a graph class G namely ob(G) is defined to be the set of the minor minimal graphs that do not belong in G. According to the result of Robertson and Seymour in their Graphs Minors series of papers (see [32] for a survey) the minor minimal elements of any graph class are finite. It follows that if a graph class G is closed under taking of minors then, for any graph G, G 2 G iff none of the graphs in ob(G) is a minor of G. In the same series of papers, Robertson and Seymour prove that there exists an ....

N. Robertson and P. D. Seymour. Graph width and well-quasi ordering: a survey. In J. A. Bondy and U. S. R. Murty, editors, Progress in Graph Theory, pages 399--406, Toronto, 1984. Academic Press.

....p processors and run a binary search over the set of critical values. In the latter case we obtain a poly log algorithm with mn O(logn) processors for computing over any ordered field. Once is known, we can solve the system S 0 with = 7. Bounded tree width Robertson and Seymour [18] introduced the notion of the tree width of a graph. This notion lends itself via the constraints graph to systems of linear inequalities with at most two variables per inequality. Definition 7.1. A connected graph G is said to have tree width less than or equal to k if there is a family V = fV 1 ....

N. Robertson and P. D. Seymour, "Graph width and well-quasi-ordering: a survey," Progress in Graph Theory, Academic Press Canada, 1984, pp. 399--406.

....is isomorphic to a minor of another, then C must be finite. The most outstanding question on the way to answer this problem is to give a characterization of the structure of those graphs not containing an arbitrary fixed graph as a minor. Robertson and Seymour made a corresponding conjecture in [15]. To give it here we need some definitions first. A graph G is the clique sum of graphs G1 and G 2 if it can be obtained from G1 and G 2 by choosing a clique from each (of the same size) deleting See the Acknowledgments at the end of this paper. 349 0095 8956 89 3.00 Copyfight. 1989 by ....

....and P. D. Seymour s preprints [20 23] and obtained information on [24] In [24] a positive solution of K. Wagher s conjecture (1.1) by N. Robertson and P.D. Seymour was announced. Moreover in [23] N. Robertson and P. D. Seymour mention (at the top of page 3) that their Conjecture 5. 1 from [15] is false (without proof) and state and prove a correct version of it. We are grateful to N. Robertson and P. D. Seymour for sending us their stimulating articles. Moreover we thank the referee for several helpful comments and suggestions. In particular we are grateful to him for permitting us to ....

N. ROBERTSON AND P. D. SEYMOUR, Graph width and well-quasi-ordering: A survey, in "Progress in Graph Theory" (J.A. Bondy and U.S.R. Murty, Eds.), pp. 399406, Academic Press, San Diego/Toronto, 1984.

No context found.

N. Robertson and P.D. Seymour, Graph Width and Well-Quasi-Ordering: a Survey, in: Progress in Graph Theory, Eds.: J. A. Bondy and U.S.R. Murty, Academic Press, New York, 399-406, (1984).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC