{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:22:10Z","timestamp":1743081730408,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_20","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"259-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs"],"prefix":"10.1007","author":[{"given":"Sandip","family":"Das","sequence":"first","affiliation":[]},{"given":"Siddani Bhaskara","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Uma kant","family":"Sahoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids, 2nd ed. Encyclopedia of Mathematics, vol. 46. Cambridge University Press, New York (1999)","DOI":"10.1017\/CBO9780511586507"},{"key":"20_CR2","first-page":"139","volume":"15","author":"P Bose","year":"2013","unstructured":"Bose, P., et al.: Coloring and guarding arrangements. Discret. Math. Theor. Comput. Sci. 15, 139\u2013154 (2013)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/jgt.20302","volume":"58","author":"P Bose","year":"2008","unstructured":"Bose, P., et al.: A characterization of the degree sequences of 2-trees. J. Graph Theory 58, 191\u2013209 (2008)","journal-title":"J. Graph Theory"},{"issue":"6","key":"20_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218195903001281","volume":"13","author":"P Bose","year":"2003","unstructured":"Bose, P., Everett, H., Wismath, S.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl. 13(6), 447\u2013462 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"20_CR5","unstructured":"Erd\u0151s, P., Purdy, G.: Extremal problems in combinatorial geometry. In: Graham, R.L., et al. (eds.) Handbook of Combinatorics, vol. I, pp. 809\u2013874. Elsevier, Amsterdam (1995)"},{"key":"20_CR6","first-page":"264","volume":"11","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok"},{"key":"20_CR7","series-title":"Advanced Lectures in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0","volume-title":"Geometric Graphs and Arrangements","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-322-80303-0"},{"key":"20_CR8","volume-title":"Handbook of Discrete and Computational Geometry","author":"S Felsner","year":"2017","unstructured":"Felsner, S., Goodman, J.E.: Pseudoline arrangements, Chapter 5. In: Goodman, J.E., et al. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn. CRC Press, Boco Raton (2017)","edition":"3"},{"issue":"17","key":"20_CR9","doi-asserted-by":"publisher","first-page":"2470","DOI":"10.1016\/j.dam.2006.04.006","volume":"154","author":"S Felsner","year":"2006","unstructured":"Felsner, S., Hurtado, F., Noy, M., Streinu, I.: Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154(17), 2470\u20132483 (2006). Extended abstract in Proceedings of SODA 2000, 155\u2013164","journal-title":"Discret. Appl. Math."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/10692760_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Felsner","year":"1998","unstructured":"Felsner, S., Krieger, K.: Triangles in Euclidean arrangements. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 137\u2013148. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/10692760_12"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0095-8956(78)90039-4","volume":"25","author":"J Folkman","year":"1978","unstructured":"Folkman, J., Lawrence, J.: Oriented matroids. J. Comb. Theory Ser. B 25, 199\u2013236 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"561","DOI":"10.2307\/2045427","volume":"92","author":"Z F\u00fcredi","year":"1984","unstructured":"F\u00fcredi, Z., Palasti, I.: Arrangements of lines with a large number of triangles. Proc. Am. Math. Soc. 92, 561\u2013566 (1984)","journal-title":"Proc. Am. Math. Soc."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(80)90096-5","volume":"32","author":"JE Goodman","year":"1980","unstructured":"Goodman, J.E.: Proof of a conjecture of Burr, Gr\u00fcnbaum and Sloane. Discret. Math. 32, 27\u201335 (1980)","journal-title":"Discret. Math."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(84)90050-5","volume":"37","author":"JE Goodman","year":"1984","unstructured":"Goodman, J.E., Pollack, R.: Semispaces of configurations, cell complexes of arrangements. J. Comb. Theory Ser. A 37, 257\u2013293 (1984)","journal-title":"J. Comb. Theory Ser. A"},{"key":"20_CR15","unstructured":"Greenwell, D.L., Hemminger, R.L., Kleitman, J.: Forbidden subgraphs. In: Proceedings of 4th South East Conference of Graph Theory and Computing, Florida Atlantic University, pp. 389\u2013394 (1973)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Arrangements and Spreads. Regional Conference Series in Mathematics. Amer. Math. Soc. Providence, RI (1972)","DOI":"10.1090\/cbms\/010"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. Int. J. Soc. Ind. Appl. Math. 10, 496\u2013506 (1962)","journal-title":"Int. J. Soc. Ind. Appl. Math."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"PL Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1, 275\u2013284 (1981). https:\/\/doi.org\/10.1007\/BF02579333","journal-title":"Combinatorica"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs. \u010casopis P\u011bst Mat 80, 477\u2013480 (1955)","journal-title":"\u010casopis P\u011bst Mat"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/eujc.1997.0151","volume":"19","author":"AV Kostochka","year":"1998","unstructured":"Kostochka, A.V., Ne\u0161et\u0159il, J.: Coloring relatives of intervals on the plane, I: chromatic number versus girth. Eur. J. Comb. 19, 103\u2013110 (1998)","journal-title":"Eur. J. Comb."},{"key":"20_CR21","unstructured":"Levi, F.: Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade, Ber. Math.-Phys. Kl. S\u00e4chs. Akad. Wiss. Leipzig, 78, 256\u2013267 (1926)"},{"key":"20_CR22","first-page":"461","volume":"5","author":"E Melchior","year":"1940","unstructured":"Melchior, E.: \u00dcber Vielseite der projektiven Ebene. Deutsche Mathematik 5, 461\u2013475 (1940)","journal-title":"Deutsche Mathematik"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0195-6698(03)00030-1","volume":"24","author":"R Merris","year":"2003","unstructured":"Merris, R.: Split graphs. Eur. J. Comb. 24(4), 413\u2013430 (2003)","journal-title":"Eur. J. Comb."},{"key":"20_CR24","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2002","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2002)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:10:44Z","timestamp":1611792644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","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":"39","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":"48% - 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,8","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":"2,21","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)"}}]}}