{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T13:15:39Z","timestamp":1777468539828,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Actions de Recherche Concert\u00e9es (ARC) fund of the Communaut\u00e9 fran\u00e7aise de Belgique."},{"name":"Endeavour Fellowship from the Australian Government."},{"name":"QEII Research Fellowship from the Australian Research Council (ARC)."}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1016\/j.ejc.2011.10.005","type":"journal-article","created":{"date-parts":[[2012,1,7]],"date-time":"2012-01-07T16:45:44Z","timestamp":1325954744000},"page":"488-490","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nordhaus\u2013Gaddum for treewidth"],"prefix":"10.1016","volume":"33","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/j.ejc.2011.10.005_br000005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.ejc.2011.10.005_br000010","series-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"2010"},{"issue":"4","key":"10.1016\/j.ejc.2011.10.005_br000015","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/jgt.20113","article-title":"Nordhaus\u2013Gaddum-type theorems for decompositions into many parts","volume":"50","author":"F\u00fcredi","year":"2005","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"10.1016\/j.ejc.2011.10.005_br000020","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(99)00175-2","article-title":"On the Haj\u00f3s number of graphs","volume":"213","author":"Gutin","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2011.10.005_br000025","unstructured":"Ton Kloks, Hans Bodlaender, Only few graphs have bounded treewidth. Tech. Rep. RRR-CS-92-35, Utrecht University, Netherlands, 1992. http:\/\/www.cs.uu.nl\/research\/techreps\/repo\/CS-1992\/1992-35.pdf."},{"key":"10.1016\/j.ejc.2011.10.005_br000030","series-title":"Finite And Infinite Sets","first-page":"537","article-title":"On Hadwiger numbers of a graph and its complement","volume":"vol. 37","author":"Kostochka","year":"1981"},{"key":"10.1016\/j.ejc.2011.10.005_br000035","unstructured":"Choongbum Lee, Joonkyung Lee, Sang il Oum, Rank-width of random graphs, J. Graph Theory, in press, (doi:10.1002\/jgt.20620)."},{"key":"10.1016\/j.ejc.2011.10.005_br000040","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.ejc.2011.10.005_br000045","unstructured":"Guillem Perarnau, Oriol Serra, On the tree-depth of random graphs, 2011. http:\/\/arxiv.org\/abs\/1104.2132."},{"key":"10.1016\/j.ejc.2011.10.005_br000050","series-title":"Surveys In Combinatorics","first-page":"87","article-title":"Tree width and tangles: a new connectivity measure and some applications","volume":"vol. 241","author":"Reed","year":"1997"},{"issue":"1","key":"10.1016\/j.ejc.2011.10.005_br000055","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/jctb.1999.1930","article-title":"Clique minors in graphs and their complements","volume":"78","author":"Reed","year":"2000","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/j.ejc.2011.10.005_br000060","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/jctb.1993.1027","article-title":"Graph searching and a min\u2013max theorem for tree-width","volume":"58","author":"Seymour","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20133","key":"10.1016\/j.ejc.2011.10.005_br000065","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(92)90611-I","article-title":"On Hadwiger\u2019s number\u2014a problem of the Nordhaus\u2013Gaddum type","volume":"101","author":"Stiebitz","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2011.10.005_br000070","series-title":"Contemporary Methods in Graph Theory","first-page":"557","article-title":"On Hadwiger numbers of a graph and its complement","author":"Stiebitz","year":"1990"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669811002046?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669811002046?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T04:06:34Z","timestamp":1759291594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669811002046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["S0195669811002046"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2011.10.005","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2012,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nordhaus\u2013Gaddum for treewidth","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2011.10.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2012 Gwena\u00ebl Joret and David R. Wood. Published by Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}