{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:23:16Z","timestamp":1758824596903},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,17]],"date-time":"2012-11-17T00:00:00Z","timestamp":1353110400000},"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":[[2014,1]]},"DOI":"10.1007\/s00373-012-1247-y","type":"journal-article","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T21:59:44Z","timestamp":1353103184000},"page":"47-69","source":"Crossref","is-referenced-by-count":4,"title":["Plane Graphs with Parity Constraints"],"prefix":"10.1007","volume":"30","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Hackl","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,17]]},"reference":[{"key":"1247_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Hackl, T., Hoffmann, M., Pilz, A., Rote, G., Speckmann, B., Vogtenhuber, B.: Plane graphs with parity constraints. In: Dehne, F., Munro, I., Sack, J.R., Tamassia, R. (eds.) Algorithms and Data Structures Symposium\u2014WADS 2009. Lecture Notes in Computer Science, Vol. 5664, pp. 13\u201324. Springer (2009)","DOI":"10.1007\/978-3-642-03367-4_2"},{"issue":"4","key":"1247_CR2","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1137\/090767947","volume":"23","author":"O. Aichholzer","year":"2010","unstructured":"Aichholzer O., Hackl T., Huemer C., Hurtado F., Vogtenhuber B.: Large bichromatic point sets admit empty monochromatic 4-gons. SIAM J. Discrete Math. 23(4), 2147\u20132155 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1247_CR3","unstructured":"Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. In: Proceedings of the 13th Canadian Conference on Computational Geometry, pp. 17\u201320. Waterloo, Ontario, Canada (2001)"},{"key":"1247_CR4","unstructured":"Alvarez, V.: Even triangulations of planar sets of points with Steiner points. In: Proceedings of the 26th European Workshop on Computational Geometry\u2014EuroCG 2010, pp. 37\u201340. Dortmund, Germany (2010)"},{"issue":"3","key":"1247_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P. Bose","year":"2002","unstructured":"Bose P.: On embedding an outer-planar graph in a point set. Comp. Geom.-Theor. Appl. 23(3), 303\u2013312 (2002)","journal-title":"Comp. Geom.-Theor. Appl."},{"issue":"2","key":"1247_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"1","author":"P. Bose","year":"1997","unstructured":"Bose P., McAllister M., Snoeyink J.: Optimal algorithms to embed trees in a point set. J. Graph Algorithms Appl. 1(2), 1\u201315 (1997)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"1247_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0210015","volume":"10","author":"C. Colbourn","year":"1981","unstructured":"Colbourn C., Booth K.: Linear time automorphism algorithms for trees, interval graphs, and planar graphs. SIAM J. Comput. 10(1), 203\u2013225 (1981)","journal-title":"SIAM J. Comput."},{"key":"1247_CR8","first-page":"264","volume":"11","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P., Gallai T.: Graphs with prescribed degree of vertices. Mat. Lapok 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"1247_CR9","unstructured":"Fern\u00e1ndez Delago, I., Grima Ruiz, C.I., M\u00e1rquez P\u00e9rez, A., Nakamoto, A., Robles Arias, R., Valenziela Mun\u00f5z, J.: Even and quasi-even triangulations of point sets in the plane. In: Proceedings of the 26th European Workshop on Computational Geometry\u2014EuroCG 2010, pp. 161\u2013164. Dortmund, Germany (2010)"},{"issue":"3","key":"1247_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01304073","volume":"79","author":"H. Fleischner","year":"1975","unstructured":"Fleischner H.: Gedanken zur Vier-Farben-Vermutung. Monatsh. Math. 79(3), 201\u2013211 (1975)","journal-title":"Monatsh. Math."},{"key":"1247_CR11","unstructured":"Gilbert, P.D.: New Results on Planar Triangulations. Master\u2019s thesis, University of Illinois at Urbana-Champaign (1979)"},{"issue":"2","key":"1247_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0925-7721(93)90003-O","volume":"3","author":"K. Jansen","year":"1993","unstructured":"Jansen K.: One strike against the min-max degree triangulation problem. Comp. Geom.-Theor. Appl. 3(2), 107\u2013120 (1993)","journal-title":"Comp. Geom.-Theor. Appl."},{"issue":"1&2","key":"1247_CR13","first-page":"1","volume":"25","author":"L. Kettner","year":"2003","unstructured":"Kettner L., Kirkpatrick D., Mantler A., Snoeyink J., Speckmann B., Takeuchi F.: Tight degree bounds for pseudo-triangulations of points. Comp. Geom.-Theor. Appl. 25(1&2), 1\u201312 (2003)","journal-title":"Comp. Geom.-Theor. Appl."},{"key":"1247_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G.T. Klincsek","year":"1980","unstructured":"Klincsek G.T.: Minimal triangulations of polygonal domains. Ann. Discrete Math. 9, 121\u2013123 (1980)","journal-title":"Ann. Discrete Math."},{"key":"1247_CR15","doi-asserted-by":"crossref","unstructured":"Kooshesh, A., Moret, B.: Folding a triangulated simple polygon: Structural and algorithmic results. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) Proceedings of the International Conference on Computing and Information, ICCI \u201991. Lecture Notes in Computer Science, Vol. 497, pp. 102\u2013110. Springer (1991)","DOI":"10.1007\/3-540-54029-6_158"},{"issue":"2","key":"1247_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"1247_CR17","volume-title":"Combinatorial problems and exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L.: Combinatorial problems and exercises. North-Holland Pub. Co., Amsterdam (1979)"},{"key":"1247_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804120","volume-title":"Computational Geometry in C","author":"J. O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke J.: Computational Geometry in C, 2nd edn. Cambridge University Press, New York (1998)","edition":"2"},{"key":"1247_CR19","unstructured":"Pel\u00e1ez, C., Ram\u00edrez-Vigueras, A., Urrutia, J.: Triangulations with many points of even degree. In: Proceedings of the 22nd Canadian Conference on Computational Geometry\u2014CCCG 2010, pp. 103\u2013106. Winnipeg, Canada (2010)"},{"key":"1247_CR20","unstructured":"Pilz, A.: Parity Properties of Geometric Graphs. Master\u2019s thesis, Graz University of Technology, Austria (2009)"},{"key":"1247_CR21","doi-asserted-by":"crossref","unstructured":"Rote, G., Santos, F., Streinu, I.: Pseudo-triangulations\u2014a survey. In: Goodman, E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry\u2014Twenty Years Later. Contemporary Mathematics, Vol. 453, pp. 343\u2013411. American Mathematical Society, Providence, RI, USA (2008)","DOI":"10.1090\/conm\/453\/08807"},{"key":"1247_CR22","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0020-0190(92)90087-C","volume":"44","author":"A. Tamura","year":"1992","unstructured":"Tamura A., Tamura Y.: Degree constrained tree embedding into points in the plane. Inform. Process. Lett. 44, 211\u2013214 (1992)","journal-title":"Inform. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1247-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1247-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1247-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T18:30:38Z","timestamp":1562351438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1247-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,17]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1247"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1247-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,17]]}}}