{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:13:35Z","timestamp":1773882815456,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"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":[[2005,9]]},"DOI":"10.1007\/s00373-004-0606-8","type":"journal-article","created":{"date-parts":[[2005,10,25]],"date-time":"2005-10-25T13:35:17Z","timestamp":1130247317000},"page":"333-341","source":"Crossref","is-referenced-by-count":6,"title":["On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets"],"prefix":"10.1007","volume":"21","author":[{"given":"Criel","family":"Merino","sequence":"first","affiliation":[]},{"given":"Gelasio","family":"Salazar","sequence":"additional","affiliation":[]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"606_CR1","doi-asserted-by":"crossref","unstructured":"Abellanas, M., Garc\u00eda, J., Hern\u00e1ndez, G., Noy, M., Ramos, P.: Bipartite embeddings of trees in the plane. Graph Drawing 96 (Lect. Notes Comput. Sci. 1990, pp. 1\u201310) Berlin: Springer-Verlag 1997","DOI":"10.1007\/3-540-62495-3_33"},{"key":"606_CR2","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Urrutia, J.: Simple alternating path problems. Discrete Math. 84, 101\u2013103 (1990)","DOI":"10.1016\/0012-365X(90)90276-N"},{"key":"606_CR3","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Pach, J.: Partitioning colored point sets into monochromatic parts. Int. J. Comput. Geom. Appl. 12(5), 401\u2013412 (2002)","DOI":"10.1142\/S0218195902000943"},{"key":"606_CR4","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Kaye, R.: Matching colored points in the plane, some new results. Comput. Geom. Theory Appl. 19(1), 69\u201385 (2001)","DOI":"10.1016\/S0925-7721(01)00007-4"},{"key":"606_CR5","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Steiger, W.: On a matching problem on the plane. Discrete Math. 211, 183\u2013195 (2000)","DOI":"10.1016\/S0012-365X(99)00201-0"},{"key":"606_CR6","doi-asserted-by":"crossref","unstructured":"Kano, M., Merino, C., Urrutia, J.: On spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93, 301\u2013306 (2005)","DOI":"10.1016\/j.ipl.2004.12.003"},{"key":"606_CR7","doi-asserted-by":"crossref","unstructured":"Karoli, G., Pach, J., T\u00f3th, G.: Ramsey-type results for geometric graphs, I. Discrete Comput. Geom. 18, 247\u2013255 (1995)","DOI":"10.1007\/PL00009317"},{"key":"606_CR8","doi-asserted-by":"crossref","unstructured":"Karoli, G., Pach, J., T\u00f3th, G., Valtr, P.: Ramsey-type results for geometric graphs, II. Discrete Comput. Geom. 20, 375\u2013388 (1998)","DOI":"10.1007\/PL00009391"},{"key":"606_CR9","doi-asserted-by":"crossref","unstructured":"Pach, J.: Geometric graph theory. J.D. Lamb and D. Preece: Surveys in combinatorics, Canterbury 1999 (Lond. Math. Soc. Lect. Note Ser., vol. 267, pp. 167\u2013200) Cambridge.: Cambridge Univ. Press 1999","DOI":"10.1017\/CBO9780511721335.007"},{"key":"606_CR10","doi-asserted-by":"crossref","unstructured":"Tokunaga, S.: Crossing number of two-connected geometric graphs. Inf. Process. Lett 59, 331\u2013333 (1996)","DOI":"10.1016\/0020-0190(96)00124-X"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-004-0606-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-004-0606-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-004-0606-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T13:38:10Z","timestamp":1586525890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-004-0606-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["606"],"URL":"https:\/\/doi.org\/10.1007\/s00373-004-0606-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}