{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:49Z","timestamp":1725890089359},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_65","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"230-235","source":"Crossref","is-referenced-by-count":3,"title":["A short proof of a Gauss problem"],"prefix":"10.1007","author":[{"given":"H.","family":"de Fraysseix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ossona de Mendez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"21_CR1","first-page":"724","volume":"274","author":"A. Bouchet","year":"1972","unstructured":"A. Bouchet. Caract\u00e9risation des symboles crois\u00e9s de genre nul. C.R. Acad. Sci., 274:724\u2013727, 1972. (Paris).","journal-title":"C.R. Acad. Sci."},{"key":"21_CR2","unstructured":"H. de Fraysseix. Sur la repr\u00e9sentation d'une suite \u00e0 triples et \u00e0 doubles occurrences par la suite des points d'intersection d'une courbe ferm\u00e9e du plan. In Probl\u00e8mes combinatoires et th\u00e9orie des graphes, volume 260 of Colloques internationaux C.N.R.S., pages 161\u2013165. C.N.R.S., 1976."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H. Fraysseix de","year":"1981","unstructured":"H. de Fraysseix. Local complementation and interlacement graphs. Discrete Mathematics, 33:29\u201335, 1981.","journal-title":"Discrete Mathematics"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02401740","volume":"67","author":"M. Dehn","year":"1936","unstructured":"M. Dehn. \u00dcber kombinatorische topologie. Acta Math., 67:123\u2013168, 1936. (Sweden).","journal-title":"Acta Math."},{"key":"21_CR5","unstructured":"H. Fleischner. Cycle decompositions, 2-coverings, removable cycles, and the four-color-disease. Progress in Graph Theory, pages 233\u2013246, 1984."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0021-9800(69)80060-8","volume":"7","author":"G.K. Francis","year":"1969","unstructured":"G.K. Francis. Null genus realizability criterion for abstract intersection sequences. J. Combinatorial Theory, 7:331\u2013341, 1969.","journal-title":"J. Combinatorial Theory"},{"key":"21_CR7","unstructured":"C.F. Gauss. Werke, pages 272 and 282\u2013286. Teubner Leipzig, 1900."},{"key":"21_CR8","unstructured":"A. Kotzig. Eulerian lines in finite 4-valent graphs and their transformations. In Proceedings of the Colloquium held at Tihany, Hungary, pages 219\u2013230, 1969."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1090\/S0002-9904-1976-13986-9","volume":"82","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz and M.L. Marx. A forbidden subgraph characterization of gauss codes. Bull. Am. Math. Soc., 82:121\u2013122, 1976.","journal-title":"Bull. Am. Math. Soc."},{"key":"21_CR10","first-page":"610","volume":"134","author":"M.L. Marx","year":"1972","unstructured":"M.L. Marx. The gauss realizability problem. Trans Am. Math. Soc., 134:610\u2013613, 1972.","journal-title":"Trans Am. Math. Soc."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01475475","volume":"26","author":"J. Nagy","year":"1927","unstructured":"J.V.Sz. Nagy. \u00dcber ein topologisches problem von gauss. Maht. Z., 26:579\u2013592, 1927. (Paris).","journal-title":"Maht. Z."},{"key":"21_CR12","unstructured":"R.C. Read and P. Rosenstiehl. On the gauss crossing problem. In Colloquia Mathematica Societatis J\u00e1nos Bolyai, pages 843\u2013875, 1976. (Hungary)."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-5060(08)70508-9","volume":"3","author":"R.C. Read","year":"1978","unstructured":"R.C. Read and P. Rosenstiehl. On the principal edge tripartition of a graph. Annals of Discrete Maths, 3:195\u2013226, 1978.","journal-title":"Annals of Discrete Maths"},{"key":"21_CR14","unstructured":"P. Rosenstiehl.Les graphes d'entrelacement d'un graphe. In Probl\u00e8mes combinatoires et th\u00e9orie des graphes, volume 260 of Colloques internationaux C.N.R.S., pages 359\u2013362. C.N.R.S., 1976."},{"issue":"A","key":"21_CR15","first-page":"551","volume":"283","author":"P. Rosenstiehl","year":"1976","unstructured":"P. Rosenstiehl. Solution alg\u00e9brique du probl\u00e8me de gauss sur la permutation des points d'intersection d'une ou plusieurs courbes ferm\u00e9es du plan. C.R. Acad. Sci., 283 (A):551\u2013553, 1976. (Paris).","journal-title":"C.R. Acad. Sci."},{"key":"21_CR16","unstructured":"P. Rosenstiehl. A geometric proof of a Gauss crossingg problem. (to appear)."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0196-6774(84)90018-X","volume":"5","author":"P. Rosenstiehl","year":"1984","unstructured":"P. Rosenstiehl and R.E. Tarjan. Gauss codes, planar hamiltonian graphs, and stack-sortable permutations. Jour. of Algorithms, 5:375\u2013390, 1984.","journal-title":"Jour. of Algorithms"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"H. Shank. The theory of left-right paths. In Combinatorial Math., volume III of Lecture Notes in Math., pages 42\u201354. Springer, 1975.","DOI":"10.1007\/BFb0069542"},{"key":"21_CR19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/00029890.1941.11991103","volume":"4","author":"W.T. Tutte","year":"1941","unstructured":"W.T. Tutte. On unicursal paths in a network of degree 4. Amer. Math. Monthly, 4:233\u2013237, 1941.","journal-title":"Amer. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T11:04:07Z","timestamp":1549191847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}