On a characterization of Gauss codes

Discrete and Computational Geometry

Volumn 22, Issue 2, 1999, Pages 287-295

  De Fraysseix, H ^a   De Mendez, P Ossona ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033418613     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009461     Document Type: Article

References (20)

1. A. Bouchet. Caractérisation des symboles croisés de genre nul. C. R. Acad. Sci. Paris, 274:724-727, 1972.
2. H. de Fraysseix. Sur la représentation d'une suite à triples et à doubles occurrences par la suite des points d'intersection d'une courbe fermée du plan. In Problèmes combinatoires et théorie des graphes, volume 260 of Colloques internationaux C.N.R.S., pages 161-165. C.N.R.S., Paris, 1976.
3. H. de Fraysseix. Local complementation and interlacement graphs. Discrete Math., 33:29-35, 1981.
4. M. Dehn. Über kombinatorische Topologie. Acta Math., 67:123-168, 1936.
5. H. Fleischner. Cycle decompositions, 2-coverings, removable cycles, and the four-color-disease. Progress in Graph Theory, pages 233-246, 1984.
6. G.K. Francis. Null genus realizability criterion for abstract intersection sequences. J. Combin. Theory, 7:331-341, 1969.
7. C.F. Gauss. Werke, pages 272 and 282-28. Teubner, Leipzig, 1900.
8. A. Kotzig. Eulerian lines in finite 4-valent graphs and their transformations. In Proceedings of the Colloquium held at Tihany, Hungary, pages 219-230, 1969.
9. L. Lovász and M.L. Marx. A forbidden subgraph characterization of gauss codes. Bull. Amer. Math. Soc., 82:121-122, 1976.
10. M.L. Marx. The gauss realizability problem. Proc. Amer. Math. Soc., 22:610-613, 1969.
11. J.V.Sz. Nagy. Über ein topologisches Problem von Gauss. Math. Z., 26:579-592, 1927.
12. R.C. Read and P. Rosenstiehl. On the Gauss Crossing Problem. Colloquia Mathematica Societatis János Bolyai, pages 843-875. North-Holland, Amsterdam, 1976.
13. R.C. Read and P. Rosenstiehl. On the principal edge tripartition of a graph. Ann. Discrete Math., 3:195-226, 1978.
14. P. Rosenstiehl. A new proof of the gauss interlace conjecture. (In preparation.)
15. P. Rosenstiehl. Les graphes d'entrelacement d'un graphe. In Problèmes combinatoires et théorie des graphes, volume 260 of Colloques internationaux C.N.R.S., pages 359-362. C.N.R.S., 1976.
16. P. Rosenstiehl. Solution algebrique du problème de Gauss sur la permutation des points d'intersection d'une ou plusieurs courbes fermées du plan. C. R. Acad. Sci. Paris, 283(A):551-553, 1976.
17. P. Rosenstiehl and R.E. Tarjan. Gauss codes, planar hamiltonian graphs, and stack-sortable permutations. Algorithms, 5:375-390, 1984.
18. H. Shank. The theory of left-right paths. In Combinatorial Mathematics, volume III of Lecture Notes in Mathematics, pages 42-54. Springer-Verlag, Berlin, 1975.
19. L.B. Treybig. A characterization of the double point structure of a projection of a polygonal knot in regular position. Trans. Amer. Math. Soc., 30:223-247, 1968.
20. W.T. Tutte. On unicursal paths in a network of degree 4. Amer. Math. Monthly, 4:233-237, 1941.