N. Robertson and P. D. Seymour. Graph Structure Theory: Proc. Joint Summer Res. Conf. Graph Minors. Contemporary Mathematics 147. Amer. Math. Soc., 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the other known results, but can only nd paths of constant length. A nal note of caution is in order. One should not be confused by the super cial similarity between the subgraph isomorphism problems posed here and the graph minor problems studied extensively by Robertson, Seymour, and others [43]. One can recognize path subgraphs by minor testing, but such tricks do not work for most other subgraph isomorphism problems. The absence of a xed minor imposes severe structural constraints on a graph, whereas this is much less the case when a xed subgraph is not present. Although minor ....

N. Robertson and P. D. Seymour. Graph Structure Theory: Proc. Joint Summer Res. Conf. Graph Minors. Contemporary Mathematics 147. Amer. Math. Soc., 1991.

....the other known results, but can only nd paths of constant length. A nal note of caution is in order. One should not be confused by the super cial similarity between the subgraph isomorphism problems posed here and the graph minor problems studied extensively by Robertson, Seymour, and others [43]. One can recognize path subgraphs by minor testing, but such tricks do not work for most other subgraph isomorphism problems. The absence of a xed minor imposes severe structural constraints on a graph, whereas this is much less the case when a xed subgraph is not present. Although minor ....

N. Robertson and P. D. Seymour. Graph Structure Theory: Proc. Joint Summer Res. Conf. Graph Minors. Contemporary Mathematics 147. Amer. Math. Soc., 1991.

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