{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T15:29:56Z","timestamp":1687879796211},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s00493-009-2381-x","type":"journal-article","created":{"date-parts":[[2010,8,23]],"date-time":"2010-08-23T04:12:01Z","timestamp":1282536721000},"page":"595-618","source":"Crossref","is-referenced-by-count":1,"title":["On a bipartition problem of Bollob\u00e1s and Scott"],"prefix":"10.1007","volume":"29","author":[{"given":"Baogang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,24]]},"reference":[{"key":"2381_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01876314","volume":"26","author":"B. Bollob\u00e1s","year":"1993","unstructured":"B. Bollob\u00e1s and A. D. Scott: On judicious partitions, Period. Math. Hungar. 26 (1993), 127\u2013139.","journal-title":"Period. Math. Hungar."},{"issue":"4","key":"2381_CR2","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s004939970002","volume":"19","author":"B. Bollob\u00e1s","year":"1999","unstructured":"B. Bollob\u00e1s and A. D. Scott: Exact bounds for judicious partitions of graphs, Combinatorica 19(4) (1999), 473\u2013486.","journal-title":"Combinatorica"},{"key":"2381_CR3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1002\/rsa.10062","volume":"21","author":"B. Bollob\u00e1s","year":"2002","unstructured":"B. Bollob\u00e1s and A. D. Scott: Problems and results on judicious partitions, Random Structure and Algorithm 21 (2002), 414\u2013430.","journal-title":"Random Structure and Algorithm"},{"key":"2381_CR4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/jgt.3190100407","volume":"10","author":"J. A. Bondy","year":"1986","unstructured":"J. A. Bondy and S. C. Locke: Largest bipartite subgraphs in triangle-free graphs with maximum degree three, J. Graph Theory 10 (1986), 477\u2013504.","journal-title":"J. Graph Theory"},{"key":"2381_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.4153\/CJM-1973-048-x","volume":"25","author":"C. S. Edwards","year":"1973","unstructured":"C. S. Edwards: Some extremal properties of bipartite graphs, Canad. J. Math. 25 (1973), 475\u2013485.","journal-title":"Canad. J. Math."},{"key":"2381_CR6","unstructured":"C. S. Edwards: An improved lower bound for the number of edges in a largest bipartite subgraph, in: Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague (1975), 167\u2013181."},{"key":"2381_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/jgt.3190060205","volume":"6","author":"G. Hopkins","year":"1982","unstructured":"G. Hopkins and W. Staton: Extremal bipartite subgraphs of cubic triangle-free graphs, J. Graph Theory 6 (1982), 115\u2013121.","journal-title":"J. Graph Theory"},{"key":"2381_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/jgt.3190060204","volume":"6","author":"G. Malle","year":"1982","unstructured":"G. Malle: On Maximum bipartite subgraphs, J. Graph Theory 6 (1982), 105\u2013113.","journal-title":"J. Graph Theory"},{"key":"2381_CR9","first-page":"221","volume":"15","author":"F. Shahrokhi","year":"1994","unstructured":"F. Shahrokhi and L. A. Sz\u00e9kely: The complexity of the bottleneck graph bipartition problem, J. Combin. Math. Combin. Comp. 15 (1994), 221\u2013226.","journal-title":"J. Combin. Math. Combin. Comp."},{"key":"2381_CR10","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.jctb.2007.09.001","volume":"98","author":"B. Xu","year":"2008","unstructured":"B. Xu and X. Yu: Triangle-free subcubic graphs with minimum bipartite density, J. Combin. Theory Ser. B 98 (2008), 516\u2013537.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2381_CR11","first-page":"253","volume-title":"STOC\u201978; Proc. 10th Annual ACM Symposium on Theory of Computing","author":"M. Yannakakis","year":"1978","unstructured":"M. Yannakakis: Node- and edge-deletion NP-complete problems, in: STOC\u201978; Proc. 10th Annual ACM Symposium on Theory of Computing, ACM, New York, (1978), pp. 253\u2013264."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2381-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2381-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2381-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:46Z","timestamp":1559093566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2381-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["2381"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2381-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}