I. Dejter and V. Neumann-Lara, Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.  Home/Search   Document Not in Database   Summary   Related Articles

....in W X . Hence the two endpoints of this P i are connected by a path Q in W X and then P i Q is an odd cycle in G X) This shows that the Erd os P osa property does not hold for odd cycles (in fact, it holds for the cycles of length p mod m if and only if p is congruent to 0 mod m see [14] and [1]) However, we are able to show that in a certain sense, Escher walls are the only obstruction preventing the Erd os P osa property from holding. To wit, we show: Theorem 1: For all k and w there is a t(k; w) such that if G is a graph with neither k vertex disjoint odd cycles nor an Escher wall ....

I. Dejter and V. Neumann-Lara, Unboundedness for generalized odd cycle traversability and a Gallai conjecture, paper presented at the Fourth Caribbean Conference on Computing, Puerto Rico, 1985.

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