{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:29Z","timestamp":1759063469799},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T00:00:00Z","timestamp":1411689600000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1471-8","type":"journal-article","created":{"date-parts":[[2014,9,25]],"date-time":"2014-09-25T11:09:52Z","timestamp":1411643392000},"page":"1463-1471","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Dilworth Number of Auto-Chordal Bipartite Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Anne","family":"Berry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konrad","family":"Engel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,26]]},"reference":[{"key":"1471_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(85)90040-8","volume":"55","author":"C Benzaken","year":"1985","unstructured":"Benzaken, C., Hammer, P.L., de Werra, D.: Split graphs of Dilworth number 2. Discrete Mathematics 55, 123\u2013127 (1985)","journal-title":"Discrete Mathematics"},{"key":"1471_CR2","doi-asserted-by":"crossref","unstructured":"Berry, A., Sigayret, A.: Dismantlable lattices in the mirror. In: Cellier, P., Distel, F., Ganter, B. (eds.) Proceedings of ICFCA\u201913, LNAI 7880, pp. 44\u201359. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38317-5_3"},{"key":"1471_CR3","doi-asserted-by":"crossref","unstructured":"Berry, A., Brandst\u00e4dt, A., Engel, K.: The Dilworth number of auto-chordal-bipartite graphs. arXiv:1309.5787vl (2013)","DOI":"10.1007\/s00373-014-1471-8"},{"key":"1471_CR4","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (1999)"},{"key":"1471_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Annals Discrete Mathematics 1, 145\u2013162 (1977)","journal-title":"Annals Discrete Mathematics"},{"key":"1471_CR6","unstructured":"Dahlhaus, E.: Chordale Graphen im besonderen Hinblick auf parallele Algorithmen. Habilitation Thesis, Universit\u00e4t Bonn (unpublished) (1991)"},{"key":"1471_CR7","first-page":"311","volume":"19","author":"S F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congr. Numer. 19, 311\u2013315 (1977)","journal-title":"Congr. Numer."},{"key":"1471_CR8","doi-asserted-by":"crossref","first-page":"666","DOI":"10.4153\/CJM-1977-069-1","volume":"29","author":"S F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs having Dilworth number 2. Canadian J. Math. 29, 666\u2013672 (1977)","journal-title":"Canadian J. Math."},{"key":"1471_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"MC Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. JGT 2, 155\u2013163 (1978)","journal-title":"JGT"},{"key":"1471_CR10","doi-asserted-by":"crossref","unstructured":"Korpelainen, N., Lozin, V.V., Mayhill, C.: Split permutation graphs. Graphs and Combinatorics 30, 633\u2013646 (2014)","DOI":"10.1007\/s00373-013-1290-3"},{"key":"1471_CR11","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","volume":"16","author":"A Lubiw","year":"1987","unstructured":"Lubiw, A.: Doubly lexical orderings of matrices. SIAM J. Comput. 16, 854\u2013879 (1987)","journal-title":"SIAM J. Comput."},{"key":"1471_CR12","unstructured":"Nara, C.: Split graphs with Dilworth number three. Natural Science Report of the Ochanomizu University. 33(1\/2), 37\u201344 (unpublished, available online) (1982)"},{"key":"1471_CR13","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"1471_CR14","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations, Fields Institute Monographs, vol.19. AMS, Providence (2003)","DOI":"10.1090\/fim\/019"},{"key":"1471_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","volume":"45","author":"JP Spinrad","year":"1993","unstructured":"Spinrad, J.P.: Doubly lexical ordering of dense 0\u20131 matrices. IPL 45, 229\u2013235 (1993)","journal-title":"IPL"},{"key":"1471_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Alg. Discr. Meth. 3, 351\u2013358 (1982)","journal-title":"SIAM J. Alg. Discr. Meth."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1471-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1471-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1471-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T11:08:15Z","timestamp":1565867295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1471-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,26]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1471"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1471-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,26]]}}}