N. Robertson, P. Seymour, and R. Thomas. Tutte's edge colouring conjecture. Journal of Combinatorial Theory, B 70:166-183, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and Zhang should be a regular cover over a Cayley graph of an almost simple group. Let us mention at this point that the conjecture of Alspach and Zhang (though closely related to the Tutte s 4 ow conjecture) remains open even in the case if the Tutte conjecture holds for cubic graphs (see [14]) as many Cayley graphs do contain subdivisions of the Petersen graph. In this article we give the following partial answer to Question 1.3 and thus generalize the result of Alspah, Liu and Zhang to a much wider class of graphs. Theorem 1.4 Let X be a connected cubic simple graph and suppose ....

N. Robertson, P. Seymour and R. Thomas, Tutte's edge-colouring conjecture, J. Combin. Theory Ser. B, 70 (1997), 166-183.

....be obtained from a subgraph of G by contracting some edges of the subgraph and deleting the possible resulting loops. The last year Robertson, Seymour, Thomas presented the proof of Conjecture 3 for cubic graphs. This is certainly the main achievement related to Conjecture 3 so far, see references [47, 48]. One could remark that this implies the 4CC. All these conjectures (known as Tutte 3 ,4 ,5 flow conjectures) are presently open despite all the efforts which were so far made. However a significant progress has been recently made and we hope to review this in this text. One should stress that ....

N. Robertson, P. Seymour, R. Thomas. Tutte's edge-colouring conjecture. J. Combin. Theory Ser. B 70 (1997), no. 1, 166--183.

No context found.

N. Robertson, P. Seymour, and R. Thomas. Tutte's edge colouring conjecture. Journal of Combinatorial Theory, B 70:166-183, 1997.

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