| C. Thomassen, "The Jordan-Schoenflies Theorem and the Classification of Surfaces," Am. Math. Monthly, vol. 99, no. 2, pp. 116-130, 1992. |
....plane embedding of a planar 2 connected graph is strong. The following then comes as a bit of surprise: Conjecture 9 Every 2 connected graph has a strong embedding on some surface. One can show that Conjecture 9 implies CDC conjecture (assuming Jordan Theorem for 2 dimensional surfaces, see [55]) Question 30 Prove that it suffices to prove CDC conjecture for any (vertex) 2 connected graph. We shall not pursue here this geometrical motivation further. Our concern here is the combinatorial background of CDC Conjecture and its relationship to NZF and Cycle Covers. There is a numerous ....
C. Thomassen. The Jordan-Schoenflies theorem and the classification of surfaces. Am. Math. Mon. 99, No.2, 116-130 (1992).
No context found.
C. Thomassen, "The Jordan-Schoenflies Theorem and the Classification of Surfaces," Am. Math. Monthly, vol. 99, no. 2, pp. 116-130, 1992.
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