{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:02:12Z","timestamp":1743152532334,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030210762"},{"type":"electronic","value":"9783030210779"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21077-9_31","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"336-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing 3-colorable Basic Patterns on Planar Graphs"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"De Ita Luna","sequence":"first","affiliation":[]},{"given":"Cristina","family":"L\u00f3pez-Ram\u00edrez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,18]]},"reference":[{"key":"31_CR1","unstructured":"Cortese, P., Patrignani, M.: Planarity Testing and Embedding. Press LLC (2004)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Dvor\u00e1k, Z., Kr\u00e1l, D., Thomas, R.: Three-coloring triangle-free graphs on surfaces. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 120\u2013129 (2009)","DOI":"10.1137\/1.9781611973068.14"},{"key":"31_CR3","unstructured":"Gr\u00f6tzsch, H.: Ein Dreifarbensatz fr dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, vol. 8, pp. 109\u2013120 (1959)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D Johnson","year":"1985","unstructured":"Johnson, D.: The NP-completeness column: an ongoing guide. J. Algorithms 6, 434\u2013451 (1985)","journal-title":"J. Algorithms"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probleme des courbes gauches en topologie. Fund. Math. 15, 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-92198-3_10","volume-title":"Pattern Recognition","author":"C L\u00f3pez-Ram\u00edrez","year":"2018","unstructured":"L\u00f3pez-Ram\u00edrez, C., De Ita, G., Neri, A.: Modelling 3-coloring of polygonal trees via incremental satisfiability. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-L\u00f3pez, J.A., Sarkar, S. (eds.) MCPR 2018. LNCS, vol. 10880, pp. 93\u2013102. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92198-3_10"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Spirakis, P.G.: Algorithms and almost tight results for 3-colorability of small diameter graphs, Technical report (2012). arxiv.org\/pdf\/1202.4665v2.pdf","DOI":"10.1007\/978-3-642-35843-2_29"},{"key":"31_CR8","first-page":"83","volume-title":"Planar Graphs: Theory and Algoritms","author":"T Nishizeki","year":"1988","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algoritms, vol. 32, pp. 83\u201387. Elsevier, Amsterdam (1988)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R.: The four color theorem. J. Combin. Theory Ser. B 70, 2\u20134 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-17514-5_13","volume-title":"Algorithms and Computation","author":"J Stacho","year":"2010","unstructured":"Stacho, J.: 3-colouring AT-free graphs in polynomial time. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 144\u2013155. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_13"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine Eigenschaft der ebenen Komplexe. Mathematische Annalen 114, 570\u2013590 (1937)","journal-title":"Mathematische Annalen"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21077-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:04:59Z","timestamp":1687133099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21077-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030210762","9783030210779"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21077-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quer\u00e9taro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mcpr.org.mx","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.82","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.39","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}