{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:14Z","timestamp":1725493634481},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_39","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"385-393","source":"Crossref","is-referenced-by-count":2,"title":["Isoperimetric Inequalities and the Width Parameters of Graphs"],"prefix":"10.1007","author":[{"given":"L.","family":"Sunil Chandran","sequence":"first","affiliation":[]},{"given":"T.","family":"Kavitha","sequence":"additional","affiliation":[]},{"given":"C. R.","family":"Subramanian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon and V. D. Millman, \u03bb 1, isoperimetric inequalities for graphs and super concentrators, Journal of Combinatorial Theory, Series. B, 38 (1985), pp. 73\u201388.","journal-title":"Journal of Combinatorial Theory, Series. B"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Discrete Applied Mathematics, 23 (1989), pp. 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR3","first-page":"1","volume":"11","author":"H. L. Bodlaender","year":"1993","unstructured":"H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, 11 (1993), pp. 1\u201321.","journal-title":"Acta Cybernetica"},{"key":"39_CR4","unstructured":"B. Bollab\u00e1s, Combinatorics, Cambridge University Press, 1986."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B. Bollob\u00e1s","year":"1991","unstructured":"B. Bollob\u00e1s and I. Leader, Edge-isoperimetric inequalities in the grid, Combinatorica, 11 (1991), pp. 299\u2013314.","journal-title":"Combinatorica"},{"key":"39_CR7","unstructured":"L. S. Chandran and T. Kavitha, Lower bounds for width parameters of graphs using isoperimetric inequalities. Manuscript, 2003."},{"key":"39_CR8","series-title":"Tech. Rep.","volume-title":"Girth and treewidth","author":"L. S. Chandran","year":"2003","unstructured":"L. S. Chandran and C. R. Subramanian, Girth and treewidth, Tech. Rep. MPI-I-2003-NWG2-01, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 2003."},{"key":"39_CR9","unstructured":"\u2014, A spectral lower bound for the treewidth of a graph and its consequences. To appear in Information Processing Letters, 2003."},{"key":"39_CR10","first-page":"225","volume":"61","author":"J. Chlebikova","year":"1992","unstructured":"J. Chlebikova, On the tree-width of a graph, Acta Mathematica Universitatis Comenianae, 61 (1992), pp. 225\u2013236.","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"39_CR11","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"R. Diestel, Graph Theory, vol. 173, Springer Verlag, New York, 2 ed., 2000.","edition":"2 ed."},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"R. Diestel and C. Rempel, Dense minors in graphs of large girth. To Appear in Combinatorica, 2003.","DOI":"10.1007\/s00493-005-0009-3"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(81)90009-1","volume":"34","author":"P. Frankl","year":"1981","unstructured":"P. Frankl and Z. F\u00fcredi, A short proof for a theorem of Harper about Hamming spheres, Discrete Math., 34 (1981), pp. 311\u2013313.","journal-title":"Discrete Math."},{"key":"39_CR14","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory And Perfect Graphs, Academic Press, New York, 1980."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. Harper","year":"1966","unstructured":"L. Harper, Optimal numberings and isoperimetric problems on graphs, Journal of Combinatorial Theory, 1 (1966), pp. 385\u2013393.","journal-title":"Journal of Combinatorial Theory"},{"key":"39_CR16","first-page":"131","volume":"10","author":"G. O. H. Katona","year":"1975","unstructured":"G. O. H. Katona, The hamming-sphere has minimum boundary, Studia Sci. Math. Hungar., 10 (1975), pp. 131\u2013140.","journal-title":"Studia Sci. Math. Hungar."},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"A. V. Kostochka","year":"1984","unstructured":"A. V. Kostochka, Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, 4 (1984), pp. 307\u2013316.","journal-title":"Combinatorica"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"D. K\u00fchn and D. Osthus, Minors in graphs of large girth. To appear in Random Structures and Algorithms, 2003.","DOI":"10.1002\/rsa.10076"},{"key":"39_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1090\/psapm\/044\/1141923","volume":"44","author":"I. Leader","year":"1991","unstructured":"I. Leader, Discrete isoperimetric inequalities, Proc. Symp. Appl. Math., 44 (1991), pp. 57\u201380.","journal-title":"Proc. Symp. Appl. Math."},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"N. Robertson and P. D. Seymour, Graph minors I. excluding a forest, Journal of Combinatorial Theory, Ser. B, 35 (1983), pp. 39\u201361.","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"\u2014, Graph minors II: algorithmic aspects of tree-width, Journal of Algorithms, 7 (1986), pp. 309\u2013322.","journal-title":"Journal of Algorithms"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BFb0096270","volume":"939","author":"G. Schechtman","year":"1982","unstructured":"G. Schechtman, L\u00e9vy type inequality for a class of metric spaces, in Martingale Theory in Harmonic Analysis and Banach Spaces, Lecture Notes in Mathematics, vol. 939, 1982, pp. 211\u2013215.","journal-title":"Martingale Theory in Harmonic Analysis and Banach Spaces"},{"key":"39_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P. Seymour","year":"1994","unstructured":"P. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217\u2013241.","journal-title":"Combinatorica"},{"key":"39_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A. G. Thomason","year":"1984","unstructured":"A. G. Thomason, An extremal function for contractions of graphs, Math. Proc. Camb. Phil. Soc., 95 (1984), pp. 261\u2013265.","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"39_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0095-8956(83)90067-9","volume":"35","author":"C. Thomassen","year":"1983","unstructured":"C. Thomassen, Girth in graphs, Journal of Combinatorial Theory, Ser. B, 35 (1983), pp. 129\u2013141.","journal-title":"Journal of Combinatorial Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:03Z","timestamp":1556935743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}