{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:46Z","timestamp":1759063606141},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1007\/s00373-007-0750-z","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T09:06:58Z","timestamp":1192439218000},"page":"467-479","source":"Crossref","is-referenced-by-count":16,"title":["Gray Code Enumeration of Plane Straight-Line Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"O.","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"F.","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"C.","family":"Huemer","sequence":"additional","affiliation":[]},{"given":"B.","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"750_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Bra\u00df, P., Krasser, H.: Pseudo-triangulations from surfaces and a novel type of edge flip, SIAM J. Comput. 32, 1621\u20131653 (2003)"},{"key":"750_CR2","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications, Order 19, 265\u2013281 (2002)"},{"key":"750_CR3","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F.: Sequences of spanning trees and a fixed tree theorem, Comput. Geom. Theory Appl. 21, 3\u201320 (2002)"},{"key":"750_CR4","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)"},{"key":"750_CR5","unstructured":"Arenas, R., Gonzalez, J., Marquez, A., Puertas Gonzalez, M.: Grafo de Grafos Planos de un Poligono Convexo. Jornadas de Matematica Discreta y Algoritmica 4, 31\u201338 (2004)"},{"key":"750_CR6","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration, Discrete Appl. Math. 65, 21\u201346 (1996)"},{"key":"750_CR7","unstructured":"Bereg, S.: Enumerating pseudo-triangulations in the plane, Comput. Geom. Theory Appl. 30, 207\u2013222 (2005)"},{"key":"750_CR8","unstructured":"Felsner, S.: On the number of arrangements of pseudolines, Discrete Comput. Geom. 18, 257\u2013267 (1997)"},{"key":"750_CR9","unstructured":"Hernando, M.C., Hurtado, F., Marquez, A., Mora, M., Noy, M.: Geometric tree graphs of points in convex position, Discrete Appl. Math. 93, 51\u201366 (1999)"},{"key":"750_CR10","doi-asserted-by":"crossref","unstructured":"Hernando, M.C., Hurtado, F., Noy, M.: Graph of non-crossing perfect matchings. Graphs Combinat. 18, 517\u2013532 (2002)","DOI":"10.1007\/s003730200038"},{"key":"750_CR11","unstructured":"Huemer, C., Hurtado, F., Noy, M., Omana-Pulido, E.: Gray codes for non-crossing partitions and dissections of a convex polygon. In: Proc. X Encuentros de Geometria Computacional, Sevilla, 2003, pp 20\u201323"},{"key":"750_CR12","unstructured":"Huemer, C., Hurtado, F., Pfeifle, J.: Gray codes and polytopal complexes for dissections of a polygon into k-gons. In: Proc. XI Encuentros de Geometria Computacional, Santander, 2005, pp 31\u201338"},{"key":"750_CR13","unstructured":"Hurtado, F., Noy, M.: Graph of triangulations of a convex polygon and tree of triangulations. Comput. Geom. Theory Appl. 13, 179\u2013188 (1999)"},{"key":"750_CR14","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discrete Comput. Geom. 22, 333\u2013346 (1999)"},{"key":"750_CR15","unstructured":"Rivera-Campo, E., Urrutia-Galicia, V.: Hamilton cycles in the path graph of a set of points in convex position. Comput. Geom. Theory Appl. 18, 65\u201372 (2001)"},{"key":"750_CR16","doi-asserted-by":"crossref","unstructured":"Ruskey, F.: Simple combinatorial Gray codes constructed by reversing sublists. Springer Lecture Notes in Computer Science, vol. 762 (1993), pp 201\u2013208","DOI":"10.1007\/3-540-57568-5_250"},{"key":"750_CR17","doi-asserted-by":"crossref","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39, 605\u2013629 (1997)","DOI":"10.1137\/S0036144595295272"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0750-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0750-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0750-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:27Z","timestamp":1559055507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0750-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["750"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0750-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}