{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:01Z","timestamp":1775097061677,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"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":["Combinatorica"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00493-017-3593-0","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T06:01:06Z","timestamp":1502690466000},"page":"1021-1043","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Maria","family":"Axenovich","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Rollin","sequence":"additional","affiliation":[]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"3593_CR1","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.disc.2013.01.011","volume":"313","author":"L. Addario-Berry","year":"2013","unstructured":"L. Addario-Berry, F. Havet, C. L. Sales, B. Reed and S. Thomass\u00e9: Oriented trees in digraphs, Discrete Math.\n                           313 (2006), 967\u2013974, 2013.","journal-title":"Discrete Math."},{"key":"3593_CR2","volume-title":"Electronic Notes in Discrete Mathematics","author":"M. Balko","year":"2015","unstructured":"M. Balko, J. Cibulka, K. Kr\u00e1l and J. Kyn\u010dl: Ramsey numbers of ordered graphs, Electronic Notes in Discrete Mathematics, 49:419\u2013424, 2015. The Eighth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015."},{"key":"3593_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-55566-4_12","volume-title":"Discrete and computational geometry","author":"P. Brass","year":"2003","unstructured":"P. Brass, G. K\u00e1rolyi and P. Valtr: A Tur\u00e1n-type extremal theory of convex geometric graphs, In Discrete and computational geometry, volume 25 of Algorithms Combin., pages 275\u2013300. Springer, Berlin, 2003."},{"key":"3593_CR4","first-page":"227","volume-title":"Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1980), Vol. I","author":"S. A. Burr","year":"1980","unstructured":"S. A. Burr: Subtrees of directed graphs and hypergraphs, in: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1980), Vol. I, volume 28 of Congr. Numer., 227\u2013239, 1980."},{"issue":"2006","key":"3593_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(92)90003-G","volume":"56","author":"V. Capoyleas","year":"1992","unstructured":"V. Capoyleas and J. Pach: A Tur\u00e1n-type theorem on chords of a convex polygon, J. Combin. Theory Ser. B\n                           56 (2006), 9\u201315, 1992.","journal-title":"J. Combin. Theory Ser. B"},{"key":"3593_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-0208(08)72923-2","volume-title":"Topics on perfect graphs","author":"V. Chv\u00e1tal","year":"1984","unstructured":"V. Chv\u00e1tal: Perfectly ordered graphs, in: Topics on perfect graphs, volume 88 of North-Holland Math. Stud., pages 63\u201365. North-Holland, Amsterdam, 1984."},{"key":"3593_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jctb.2016.06.007","volume":"122","author":"D. Conlon","year":"2017","unstructured":"D. Conlon, J. Fox, C. Lee and B. Sudakov: Ordered Ramsey numbers, J. Combin. Theory Ser. B.\n                           122 (2017), 353\u2013383.","journal-title":"J. Combin. Theory Ser. B."},{"key":"3593_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-46908-4_25","volume-title":"Topics in combinatorics and graph theory (Oberwolfach, 1990)","author":"P. Damaschke","year":"1990","unstructured":"P. Damaschke: Forbidden ordered subgraphs, in: Topics in combinatorics and graph theory (Oberwolfach, 1990), 219\u2013229. Physica, Heidelberg, 1990."},{"key":"3593_CR9","first-page":"21","volume-title":"Eureka","author":"B. Descartes","year":"1947","unstructured":"B. Descartes: A three colour problem, Eureka 21, 1947."},{"issue":"2006","key":"3593_CR10","first-page":"339","volume":"6","author":"V. Dujmovic","year":"2004","unstructured":"V. Dujmovic and D. R. Wood: On linear layouts of graphs, Discrete Math. Theor. Comput. Sci.\n                           6 (2006), 339\u2013358, 2004.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"3593_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s: Graph theory and probability, Canad. J. Math.\n                           11 (1959), 34\u201338.","journal-title":"Canad. J. Math."},{"issue":"2006","key":"3593_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(92)90316-8","volume":"103","author":"Z. F\u00fcredi","year":"1992","unstructured":"Z. F\u00fcredi and P. Hajnal: Davenport-Schinzel theory of matrices. Discrete Math.\n                           103 (2006), 233\u2013251, 1992.","journal-title":"Discrete Math."},{"issue":"2006","key":"3593_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<71::AID-JGT1>3.0.CO;2-G","volume":"30","author":"M. Ginn","year":"1999","unstructured":"M. Ginn: Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes, J. Graph Theory\n                           30 (2006), 71\u201376, 1999.","journal-title":"J. Graph Theory"},{"issue":"2006","key":"3593_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ejc.2003.05.001","volume":"25","author":"M. Klazar","year":"2004","unstructured":"M. Klazar: Extremal problems for ordered (hyper) graphs: applications of Davenport-Schinzel sequences, European J. Combin.\n                           25 (2006), 125\u2013140, 2004.","journal-title":"European J. Combin."},{"issue":"2006","key":"3593_CR15","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2004.02.004","volume":"143","author":"M. Klazar","year":"2004","unstructured":"M. Klazar: Extremal problems for ordered hypergraphs: small patterns and some enumeration, Discrete Appl. Math.\n                           143 (2006), 144\u2013154, 2004.","journal-title":"Discrete Appl. Math."},{"issue":"2006","key":"3593_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jcta.2004.04.002","volume":"107","author":"A. Marcus","year":"2004","unstructured":"A. Marcus and G. Tardos: Excluded permutation matrices and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A\n                           107 (2006), 153\u2013160, 2004.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3593_CR17","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02773960","volume":"155","author":"J. Pach","year":"2006","unstructured":"J. Pach and G. Tardos: Forbidden paths and cycles in ordered graphs and matrices, Israel J. Math.\n                           155 (2006), 359\u2013380.","journal-title":"Israel J. Math."},{"issue":"2006","key":"3593_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jcta.2004.11.015","volume":"111","author":"G. Tardos","year":"2005","unstructured":"G. Tardos: On 0\u20131 matrices and small excluded submatrices, J. Combin. Theory Ser. A\n                           111 (2006), 266\u2013288, 2005.","journal-title":"J. Combin. Theory Ser. A"},{"key":"3593_CR19","volume-title":"Extremal problems in ordered graphs","author":"C. Weidert","year":"2009","unstructured":"C. Weidert: Extremal problems in ordered graphs, Master\u2019s thesis, Simon Fraser University, 2009. arXiv:0907.2479."},{"key":"3593_CR20","volume-title":"Introduction to graph theory","author":"D. B. West","year":"1996","unstructured":"D. B. West: Introduction to graph theory, Prentice Hall, Inc., Upper Saddle River, NJ, 1996."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-017-3593-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3593-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-017-3593-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T23:50:44Z","timestamp":1544053844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-017-3593-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["3593"],"URL":"https:\/\/doi.org\/10.1007\/s00493-017-3593-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,14]]}}}