{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:27:54Z","timestamp":1742984874183,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"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-35802-0_19","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"244-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coloring Hasse Diagrams and Disjointness Graphs of Curves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2389-2035","authenticated-orcid":false,"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8344-3592","authenticated-orcid":false,"given":"Istv\u00e1n","family":"Tomon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E Asplund","year":"1960","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a coloring problem. Math. Scand. 8, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"issue":"11","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl. Acad. Sci. U.S.A. 45(11), 1607\u20131620 (1959)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02485441","volume":"7","author":"B Bollob\u00e1s","year":"1977","unstructured":"Bollob\u00e1s, B.: Colouring lattices. Algebra Universalis 7, 313\u2013314 (1977)","journal-title":"Algebra Universalis"},{"key":"19_CR4","unstructured":"Davies, J., McCarty, R.: Circle graphs are quadratically $$\\chi $$-bounded. arXiv:1905.11578"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G Ehrlich","year":"1976","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. J. Comb. Theory Ser. B 21(1), 8\u201320 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Can. J. Math. 11, 34\u201338 (1959)","journal-title":"Can. J. Math."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1307\/mmj\/1028999083","volume":"11","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P., Hajnal, A.: Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory. Mich. Math. J. 11(2), 107\u2013127 (1964)","journal-title":"Mich. Math. J."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.aim.2012.03.011","volume":"230","author":"J Fox","year":"2012","unstructured":"Fox, J., Pach, J.: String graphs and incomparability graphs. Adv. Math. 230(3), 1381\u20131401 (2012)","journal-title":"Adv. Math."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M Golumbic","year":"1983","unstructured":"Golumbic, M., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43, 37\u201346 (1983)","journal-title":"Discrete Math."},{"key":"19_CR10","unstructured":"Graham, R.L.: Problem 1, Open Problems at 5th Hungarian Colloquium on Combinatorics (1976). In: Hajnal, A., S\u00f3s, V.T. (eds.) Combinatorics, vol. II. North-Holland, Amsterdam, p. 1195 (1978)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 55, 161\u2013166 (1985)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"19_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A Kostochka","year":"1997","unstructured":"Kostochka, A., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discrete Math. 163(1\u20133), 299\u2013305 (1997)","journal-title":"Discrete Math."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory Ser. B 52(1), 53\u201366 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00385813","volume":"8","author":"I K\u0159\u00ed\u017e","year":"1991","unstructured":"K\u0159\u00ed\u017e, I., Ne\u0161et\u0159il, J.: Chromatic number of Hasse diagrams, eyebrows and dimension. Order 8(1), 41\u201348 (1991)","journal-title":"Order"},{"key":"19_CR15","unstructured":"Lov\u00e1sz, L.: Perfect graphs. In: Selected Topics in Graph Theory, vol. 2, pp. 55\u201387. Academic Press, London (1983)"},{"issue":"1\u20133","key":"19_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0012-365X(93)90176-T","volume":"111","author":"M Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: Weakly transitive orientations, Hasse diagrams and string graphs. Discrete Math. 111(1\u20133), 393\u2013400 (1993). In: Graph theory and combinatorics (Marseille-Luminy 1990)","journal-title":"Discrete Math."},{"key":"19_CR17","unstructured":"M\u00fctze, T., Walczak, B., Wiechert, V.: Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane. arXiv:1802.09969"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0095-8956(79)90084-4","volume":"27","author":"J Ne\u0161et\u0159il","year":"1979","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory Ser. B 27(2), 225\u2013227 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR19","unstructured":"Pach, J., Tardos, G., T\u00f3th, G.: Disjointness graphs of segments. In: 33rd International Symposium on Computational Geometry, SoCG 2017, 77, Leibniz Zentrum, Dagstuhl, pp. 59:1\u201359:15 (2017)"},{"key":"19_CR20","unstructured":"Pach, J., Tomon, I.: On the chromatic number of disjointness graphs of curves. In: 35th International Symposium on Computational Geometry, SoCG 2019, 129 Leibniz Zentrum, Dagstuhl, pp. 54:1\u201354:17 (2019)"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J Pach","year":"1994","unstructured":"Pach, J., T\u00f6r\u0151csik, J.: Some geometric applications of Dilworth\u2019s theorem. Discrete Comput. Geom. 12(1), 1\u20137 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.jctb.2013.11.001","volume":"105","author":"A Pawlik","year":"2014","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory Ser. B 105, 6\u201310 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR23","unstructured":"Rok, A., Walczak, B.: Outerstring graphs are $$\\chi $$-bounded. https:\/\/arxiv.org\/abs\/1312.1559"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film RC-circuits. Bell System Tech. J. 45, 1639\u20131662 (1966)","journal-title":"Bell System Tech. J."},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1006\/jcta.1999.3001","volume":"89","author":"G T\u00f3th","year":"2000","unstructured":"T\u00f3th, G.: Note on geometric graphs. J. Comb. Theory Ser. A 89(1), 126\u2013132 (2000)","journal-title":"J. Comb. Theory Ser. A"},{"key":"19_CR26","unstructured":"Vogt, H. G.: Le\u00e7ons sur la r\u00e9solution alg\u00e9brique des \u00e9quations, Nony, p. 91 (1895)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:51Z","timestamp":1701133431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_19","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":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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"}]}}