{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:28Z","timestamp":1759638868182},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_27","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"351-363","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gon\u00e7alves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N Castro de","year":"2002","unstructured":"de Castro, N., Cobos, F., Dana, J.C., M\u00e1rquez, A., Noy, M.: Triangle-free planar graphs as segment intersection graphs. J. Graph Algorithms Appl. 6(1), 7\u201326 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00046-5","volume":"66","author":"J Czyzowicz","year":"1998","unstructured":"Czyzowicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Inform. Process. Lett. 66(3), 125\u2013126 (1998)","journal-title":"Inform. Process. Lett."},{"key":"27_CR4","unstructured":"Felsner, S.: Triangle contact representations. In: Midsummer Combinatorial Workshop (2009)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s00453-006-0157-x","volume":"47","author":"H Fraysseix de","year":"2007","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Representations by contact and intersection of segments. Algorithmica 47, 453\u2013463 (2007)","journal-title":"Algorithmica"},{"key":"27_CR6","first-page":"109","volume":"63","author":"H Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. Colloq. Math. Soc. J\u00e1nos Bolyai 63, 109\u2013117 (1994). Intuitive Geometry (Szeged, 1991)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/1.9781611975031.12","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Daniel Gon\u00e7alves","year":"2018","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar Graphs as L-intersection or L-contact graphs. In: Proceedings of SODA, pp. 172\u2013184 (2018)"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IB-A Hartman","year":"1991","unstructured":"Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math. 87(1), 41\u201352 (1991)","journal-title":"Discrete Math."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Combin. Theory. Ser. B 52, 67\u201378 (1991)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Combin. Theory. Ser. B 62, 180\u2013181 (1994)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"M\u00e1\u010dajov\u00e1, E., Raspaud, A., \u0160koviera, M.: The chromatic number of a signed graph. Electr. J. Comb. 23(1), P1, 1\u201314 (2016)","DOI":"10.37236\/4938"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jcta.2001.3184","volume":"96","author":"J Pach","year":"2001","unstructured":"Pach, J., Solymosi, J.: Crossing patterns of segments. J. Combin. Theory. Ser. A 96, 316\u2013325 (2001)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"27_CR13","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs. Ph.D., Thesis, Princeton University (1984)"},{"key":"27_CR14","unstructured":"Scheinerman, E.R.: Private communication to D. West (1993)"},{"issue":"1","key":"27_CR15","first-page":"10","volume":"2","author":"D West","year":"1991","unstructured":"West, D.: Open problems. SIAM J. Discrete Math. Newslett. 2(1), 10\u201312 (1991)","journal-title":"SIAM J. Discrete Math. Newslett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T04:03:49Z","timestamp":1611115429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_27","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":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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":"3.4","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":"1-2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}