{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:16:38Z","timestamp":1740104198860,"version":"3.37.3"},"reference-count":20,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2004,3,24]],"date-time":"2004-03-24T00:00:00Z","timestamp":1080086400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"NSF","award":["ITR 0225610"]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["F3361501-C-1900"],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2004,6]]},"abstract":"Abstract<\/jats:title>We prove results on partitioning graphs G<\/jats:italic> with bounded maximum degree. In particular, we provide optimal bounds for bipartitions V<\/jats:italic>(G<\/jats:italic>) = V<\/jats:italic>1<\/jats:sub> \u222a V<\/jats:italic>2<\/jats:sub> in which we minimize {e<\/jats:italic>(V<\/jats:italic>1<\/jats:sub>), e<\/jats:italic>(V<\/jats:italic>2<\/jats:sub>)}. \u00a9 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131\u2013143, 2004<\/jats:p>","DOI":"10.1002\/jgt.10174","type":"journal-article","created":{"date-parts":[[2004,4,2]],"date-time":"2004-04-02T08:01:46Z","timestamp":1080892906000},"page":"131-143","source":"Crossref","is-referenced-by-count":23,"title":["Judicious partitions of bounded\u2010degree graphs"],"prefix":"10.1002","volume":"46","author":[{"given":"B.","family":"Bollob\u00e1s","sequence":"first","affiliation":[]},{"given":"A. D.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2004,4,7]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01261315"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00041-1"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01876314"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.2744"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1998.0266"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s004939970002"},{"key":"e_1_2_1_8_2","first-page":"185","volume-title":"Better Bounds for Max Cut, in Contemporary Combinatorics","author":"Bollob\u00e1s B.","year":"2002"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10062"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100407"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1973-048-x"},{"key":"e_1_2_1_12_2","first-page":"167","volume-title":"Prague","author":"Edwards C. S.","year":"1975"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060205"},{"key":"e_1_2_1_14_2","first-page":"241","volume-title":"Max\u2010Cut problem, in Annotated Bibliographies in Combinatorial Optimization","author":"Laurent M.","year":"1997"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060206"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/dimacs\/020\/04","volume-title":"Editors, Combinatorial Optimization","author":"Poljak S.","year":"1995"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01285820"},{"key":"e_1_2_1_18_2","first-page":"111","article-title":"Graph partitions","volume":"15","author":"Porter T. D.","year":"1994","journal-title":"J Combin Math Combin Comp"},{"key":"e_1_2_1_19_2","first-page":"181","article-title":"Minimal partitions of a graph","volume":"53","author":"Porter T. D.","year":"1999","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_20_2","first-page":"103","article-title":"Edge deletions and the chromatic number","volume":"10","author":"Staton W.","year":"1980","journal-title":"Ars Combinatoria"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00115-0"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.10174","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.10174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T20:13:06Z","timestamp":1696623186000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.10174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["10.1002\/jgt.10174"],"URL":"https:\/\/doi.org\/10.1002\/jgt.10174","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2004,4,7]]}}}