{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T08:30:52Z","timestamp":1781253052462,"version":"3.54.1"},"reference-count":71,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90084-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"121-144","source":"Crossref","is-referenced-by-count":10,"title":["Simplicial decompositions of graphs: a survey of applications"],"prefix":"10.1016","volume":"75","author":[{"given":"Reinhard","family":"Diestel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90084-8_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(86)90026-2","article-title":"On a pursuit game played on graphs for which a minor is excluded","volume":"41","author":"Andreae","year":"1986","journal-title":"J. Combinat. Theory B"},{"key":"10.1016\/0012-365X(89)90084-8_BIB2","doi-asserted-by":"crossref","unstructured":"S. Arnborg, D.G. Corneil and A. Proskurowski, Forbidden minors characterization of partial 3-trees, Discrete Math. (to appear).","DOI":"10.1016\/0012-365X(90)90292-P"},{"key":"10.1016\/0012-365X(89)90084-8_BIB3","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(89)90084-8_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB5","first-page":"143","article-title":"On some extremal problems in graph theory (in Hungarian)","volume":"13","author":"Bollob\u00e1s","year":"1962","journal-title":"Math. Lapok"},{"key":"10.1016\/0012-365X(89)90084-8_BIB6","article-title":"Properties of acyclic database schemes","author":"Beeri","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0012-365X(89)90084-8_BIB7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0012-365X(89)90084-8_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","article-title":"Star-cutsets and perfect graphs","volume":"39","author":"Chv\u00e1tal","year":"1985","journal-title":"J. Combinat. Theory B"},{"key":"10.1016\/0012-365X(89)90084-8_BIB9","series-title":"Ph.D. Thesis","article-title":"Simplicial decompositions and universal graphs","author":"Diestel","year":"1986"},{"key":"10.1016\/0012-365X(89)90084-8_BIB10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0195-6698(85)80008-1","article-title":"On universal graphs with forbidden topological subgraphs","volume":"6","author":"Diestel","year":"1985","journal-title":"Europ. J. Combinat."},{"key":"10.1016\/0012-365X(89)90084-8_BIB11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0012-365X(85)80018-2","article-title":"On the problem of finding small subdivision and homomorphism bases for classes of countable graphs","volume":"55","author":"Diestel","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/jgt.3190110108","article-title":"A separation property of planar triangulations","volume":"11","author":"Diestel","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(89)90084-8_BIB13","unstructured":"R. Diestel, Simplicial tree-decompositions of infinite graphs II, J. Combinat. Theory B, to appear."},{"key":"10.1016\/0012-365X(89)90084-8_BIB14","unstructured":"R. Diestel, Simplicial tree-decompositions of infinite graphs III, J. Combinat. Theory B, to appear."},{"key":"10.1016\/0012-365X(89)90084-8_BIB15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S0305004100065026","article-title":"Simplicial minors and decompositions of graphs","volume":"103","author":"Diestel","year":"1988","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"10.1016\/0012-365X(89)90084-8_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(88)90071-4","article-title":"Tree-decompositions, tree-representability and chordal graphs","volume":"71","author":"Diestel","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB17","first-page":"97","article-title":"Simplicial decompositions, tree-decompositions and graphs minors","volume":"25C","author":"Diestel","year":"1988","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(89)90084-8_BIB18","unstructured":"R. Diestel, On end-faithful spanning trees in infinite graphs, submitted."},{"key":"10.1016\/0012-365X(89)90084-8_BIB19","unstructured":"R. Diestel, Graph Decompositions (Oxford University Press) in preparation."},{"key":"10.1016\/0012-365X(89)90084-8_BIB20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(89)90084-8_BIB21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01361708","article-title":"Homomorphism theorems for graphs","volume":"153","author":"Dirac","year":"1964","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB22","first-page":"135","article-title":"Structural properties and circuits in graphs","volume":"15","author":"Dirac","year":"1975","journal-title":"Congr. Num."},{"key":"10.1016\/0012-365X(89)90084-8_BIB23","volume":"27","author":"Dirac","year":"1976"},{"key":"10.1016\/0012-365X(89)90084-8_BIB24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S1385-7258(51)50053-7","article-title":"A colour problem for infinite graphs and a problem in the theory of relations","volume":"13","author":"de Bruijn","year":"1951","journal-title":"Indag. Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB25","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02579242","article-title":"Some remarks on universal graphs","volume":"5","author":"Diestel","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90084-8_BIB26","doi-asserted-by":"crossref","unstructured":"P. Duchet, M. Las Vergnas and H. Meyniel, Connected cutsets of a graph and triangle bases of the cycle space, Discrete Math. (to appear).","DOI":"10.1016\/0012-365X(86)90115-9"},{"key":"10.1016\/0012-365X(89)90084-8_BIB27","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB28","first-page":"3","article-title":"Graphen mit triangulierbaren ungeraden Vierecken","volume":"7","author":"Gallai","year":"1962","journal-title":"Magyar Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl."},{"key":"10.1016\/0012-365X(89)90084-8_BIB29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combinat. Theory B"},{"key":"10.1016\/0012-365X(89)90084-8_BIB30","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB31","article-title":"\u00dcber einen graphentheoretischen Basisbegriff und seine Anwendung auf F\u00e4rbungsprobleme","author":"Halin","year":"1962","journal-title":"Diss. K\u00f6ln"},{"key":"10.1016\/0012-365X(89)90084-8_BIB32","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01361706","article-title":"\u00dcber einen Staz von K. Wagner zum Vierfarbenproblem","volume":"153","author":"Halin","year":"1964","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB33","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01363288","article-title":"Simpliziale Zerf\u00e4llungen beliebiger (endlicher oder unendlicher) Graphen","volume":"156","author":"Halin","year":"1964","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB34","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF01351673","article-title":"Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner","volume":"172","author":"Halin","year":"1967","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB35","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/mana.19670330108","article-title":"Ein Zerlegungssatz f\u00fcr unendliche Graphen und seine Anwendung auf Homomorphiebasen","volume":"33","author":"Halin","year":"1967","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(89)90084-8_BIB36","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BF02992395","article-title":"Unterteilungen vollst\u00e4ndiger Graphen mit unendlicher chromatischer Zahl","volume":"31","author":"Halin","year":"1967","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(89)90084-8_BIB37","series-title":"Advances in Graph Theory (Annals of Discrete Mathematics 3)","article-title":"Simplicial decompositions of infinite graphs","author":"Halin","year":"1978"},{"key":"10.1016\/0012-365X(89)90084-8_BIB38","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(80)90143-0","article-title":"A note on infinite triangulated graphs","volume":"31","author":"Halin","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB39","series-title":"Graphentheorie II","author":"Halin","year":"1981"},{"key":"10.1016\/0012-365X(89)90084-8_BIB40","series-title":"Graph Theory and Combinatorics (Annals of Discrete Mathematics 13)","article-title":"Simplicial decompositions, some new aspects and applications","author":"Halin","year":"1982"},{"key":"10.1016\/0012-365X(89)90084-8_BIB41","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02579236","article-title":"Some remarks on interval graphs","volume":"2","author":"Halin","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90084-8_BIB42","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0195-6698(84)80014-1","article-title":"On the representation of trangulated graphs in trees","volume":"5","author":"Halin","year":"1984","journal-title":"Europ. J. Combinat."},{"key":"10.1016\/0012-365X(89)90084-8_BIB43","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01362670","article-title":"\u00dcber unendliche Wege in Graphen","volume":"157","author":"Halin","year":"1964","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB44","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BF01470944","article-title":"Homomorphiebasen von Graphenmengen","volume":"147","author":"Halin","year":"1962","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB45","first-page":"151","article-title":"A homomorphism theorem with an application to the Conjecture of Hadwiger","volume":"6","author":"Jakobsen","year":"1971","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(89)90084-8_BIB46","doi-asserted-by":"crossref","first-page":"379","DOI":"10.7146\/math.scand.a-11440","article-title":"On certain homomorphism properties I","volume":"31","author":"Jakobsen","year":"1972","journal-title":"Math. Scand."},{"key":"10.1016\/0012-365X(89)90084-8_BIB47","doi-asserted-by":"crossref","first-page":"229","DOI":"10.7146\/math.scand.a-12004","article-title":"On certain homomorphism properties II","volume":"52","author":"Jakobsen","year":"1983","journal-title":"Math. Scand."},{"key":"10.1016\/0012-365X(89)90084-8_BIB48","first-page":"133","article-title":"Extremal graphs for contractions to K7","volume":"25","author":"J\u00f8rgensen","year":"1988","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(89)90084-8_BIB49","unstructured":"L.K. J\u00f8rgensen, Contractions to K8, preprint."},{"key":"10.1016\/0012-365X(89)90084-8_BIB50","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01359971","article-title":"Anwendung einer Methode von K. Wagner bei F\u00e4rbungsproblemen f\u00fcr Graphen","volume":"161","author":"Jung","year":"1965","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/mana.19690410102","article-title":"Wurzelb\u00e4ume und unendliche Wege in Graphen","volume":"41","author":"Jung","year":"1969","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(89)90084-8_BIB52","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1112\/S002557930001250X","article-title":"Universal graphs without large bipartite subgraphs","volume":"31","author":"Komj\u00e1th","year":"1984","journal-title":"Mathematika"},{"key":"10.1016\/0012-365X(89)90084-8_BIB53","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0167-5060(08)70469-2","article-title":"Triangulated graphs with marked vertices","volume":"41","author":"Leimer","year":"1989","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/0012-365X(89)90084-8_BIB54","unstructured":"H.-G. Leimer, Optimal decomposition by complete separators, Discrete Math. (to appear)."},{"key":"10.1016\/0012-365X(89)90084-8_BIB55","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB56","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","volume":"55","author":"Lauritzen","year":"1988","journal-title":"J.R. Statist. Soc. B"},{"key":"10.1016\/0012-365X(89)90084-8_BIB57","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1017\/S1446788700027300","article-title":"Decomposable graphs and hypergraphs","volume":"36","author":"Lauritzen","year":"1984","journal-title":"J. Austral. Math. Soc. A"},{"key":"10.1016\/0012-365X(89)90084-8_BIB58","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","article-title":"Vertex-to-vertex pursuit in a graph","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB59","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0195-6698(81)80043-1","article-title":"A problem of Ulam on planar graphs","volume":"2","author":"Pach","year":"1981","journal-title":"Europ. J. Combinat."},{"key":"10.1016\/0012-365X(89)90084-8_BIB60","doi-asserted-by":"crossref","first-page":"331","DOI":"10.4064\/aa-9-4-331-340","article-title":"Universal graphs and universal functions","volume":"9","author":"Rado","year":"1964","journal-title":"Acta Arith."},{"key":"10.1016\/0012-365X(89)90084-8_BIB61","unstructured":"N. Robsertson and P.D. Seymour, Graph minors I\u2014XVIII, J. Combinat. Theory B (to appear)."},{"key":"10.1016\/0012-365X(89)90084-8_BIB62","first-page":"129","article-title":"Generalizing Kuratowski's Theorem","volume":"45","author":"Robertson","year":"1984","journal-title":"Congr. Num."},{"key":"10.1016\/0012-365X(89)90084-8_BIB63","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","article-title":"Decomposition by clique separators","volume":"55","author":"Tarjan","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB64","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/mana.19740640109","article-title":"Some homomorphism properties of graphs","volume":"64","author":"Thomassen","year":"1974","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(89)90084-8_BIB65","unstructured":"K. Truemper, A decomposition theory for matroids IV: decompositions of grahps, J. Combinat. Theory B (to appear)."},{"key":"10.1016\/0012-365X(89)90084-8_BIB66","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0095-8956(81)80025-1","article-title":"Non-separating induced cycles in graphs","volume":"31","author":"Thomassen","year":"1981","journal-title":"J. Combinat. Theory B"},{"key":"10.1016\/0012-365X(89)90084-8_BIB67","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/BF01594196","article-title":"\u00dcber eine eigenschaft der ebenen Komplexe","volume":"114","author":"Wagner","year":"1937","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB68","first-page":"280","article-title":"\u00dcber eine Erweiterung eines Satzes von Kuratowski","volume":"2","author":"Wagner","year":"1937","journal-title":"Deutsche Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB69","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01360256","article-title":"Bemerkungen zu Hadwigers Vermutung","volume":"141","author":"Wagner","year":"1960","journal-title":"Math. Ann."},{"key":"10.1016\/0012-365X(89)90084-8_BIB70","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(78)90123-1","article-title":"Infinite triangulated graphs","volume":"22","author":"Wagon","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90084-8_BIB71","series-title":"Topics on Perfect Graphs (Annals of Discrete Mathematics 21)","article-title":"a method for solving certain graph recognition and optimization problems","author":"Whitesides","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900848?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89900848?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:50:47Z","timestamp":1555134647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89900848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":71,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89900848"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90084-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}